The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104450 Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 3, 2, 5, 7, 12, 19, 31, 50, .... 1
 1, 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 0, 3, 0, 2, 2, 0, 3, 0, 3, 1, 2, 3, 0, 4, 0, 3, 2, 1, 3, 0, 4, 0, 3, 3, 0, 5, 0, 4, 2, 2, 4, 0, 5, 0, 3, 3, 0, 4, 0, 4, 1, 3, 4, 0, 6, 0, 5, 3, 2, 5, 0, 6, 0, 4, 4, 0, 6, 0, 5, 2, 3, 5, 0, 6, 0, 4, 3, 1, 4, 0, 5, 0, 4, 4, 0, 7, 0, 6, 3, 3, 6, 0, 8, 0, 5, 5, 0, 7, 0, 6, 2, 4, 6, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..16114 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. Ron Knott, Ron Knott's Sequence Visualiser. CROSSREFS Cf. A013655. Sequence in context: A035156 A063883 A079691 * A281460 A035226 A126043 Adjacent sequences:  A104447 A104448 A104449 * A104451 A104452 A104453 KEYWORD nonn AUTHOR Casey Mongoven, Mar 08 2005 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 23:37 EST 2020. Contains 330995 sequences. (Running on oeis4.)