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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319503 Number of partitions of Fibonacci(n) into exactly n positive Fibonacci numbers. 4
 1, 1, 0, 0, 0, 1, 2, 6, 16, 43, 117, 305, 769, 1907, 4686, 11587, 28580, 70451, 172880, 423629, 1036332, 2533559, 6186635, 15092985, 36784586, 89590410, 218069921, 530551804, 1290218120, 3136385254, 7621522229, 18515039477, 44966884766, 109184448962 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..200 FORMULA a(n) = [x^A000045(n) y^n] 1/Product_{j>=2} (1-y*x^A000045(j)). a(n) = A319394(A000045(n),n). EXAMPLE a(0) = 1: the empty partition. a(1) = 1: 1. a(5) = 1: 11111. a(6) = 2: 221111, 311111. a(7) = 6: 2222221, 3222211, 3322111, 3331111, 5221111, 5311111. CROSSREFS Cf. A000045, A098641, A259254, A319394, A319435. Sequence in context: A244399 A291142 A027994 * A295572 A027068 A003142 Adjacent sequences:  A319500 A319501 A319502 * A319504 A319505 A319506 KEYWORD nonn AUTHOR Alois P. Heinz, Sep 20 2018 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 December 4 15:12 EST 2020. Contains 338927 sequences. (Running on oeis4.)