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!)
A219483 Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 2, 7, 9, 16, 25, 41, .... 1
1, 0, 1, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 1, 0, 3, 0, 2, 0, 0, 0, 0, 2, 0, 3, 0, 1, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 2, 0, 4, 0, 2, 0, 0, 0, 0, 3, 0, 3, 0, 0, 0, 0, 1, 0, 4, 0, 3, 0, 0, 0, 0, 3, 0, 5, 0, 2, 0, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 2, 0, 5, 0, 3, 0, 0, 0, 0, 3, 0, 4, 0, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
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.
CROSSREFS
Sequence in context: A231642 A288318 A354099 * A239927 A069846 A239657
KEYWORD
nonn
AUTHOR
Casey Mongoven, Nov 20 2012
EXTENSIONS
a(0)=1 from 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 April 25 13:38 EDT 2024. Contains 371970 sequences. (Running on oeis4.)