The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116403 Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 4, 1, 5, 6, 11, ... 2
1, 1, 0, 0, 1, 2, 2, 1, 0, 1, 2, 3, 2, 0, 0, 2, 3, 3, 2, 0, 1, 3, 4, 3, 1, 0, 2, 3, 4, 3, 0, 0, 3, 5, 4, 2, 0, 2, 4, 5, 3, 0, 0, 3, 4, 4, 3, 0, 1, 4, 6, 5, 2, 0, 3, 5, 6, 4, 0, 0, 4, 6, 5, 3, 0, 2, 5, 6, 4, 1, 0, 3, 4, 5, 4, 0, 0, 4, 7, 6, 3, 0, 3, 6, 8, 5, 0, 0, 5, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
LINKS
J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498, in the issue dedicated to Aldo De Luca on the occasion of his 60th anniversary.
D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, part 1, part 2, Fib. Quart., 4 (1966), 289-306 and 322.
Casey Mongoven, Z(n) Rep Sequence no. 1; electronic music created with this sequence.
CROSSREFS
Sequence in context: A285007 A194527 A104244 * A123149 A185158 A185700
KEYWORD
nonn
AUTHOR
Casey Mongoven, Feb 13 2006
EXTENSIONS
a(0)=1 corrected by Alois P. Heinz, Sep 16 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 17:20 EDT 2024. Contains 372533 sequences. (Running on oeis4.)