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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319398 Number of partitions of n into exactly five positive Fibonacci numbers. 2
 0, 0, 0, 0, 0, 1, 1, 2, 2, 4, 4, 5, 5, 7, 6, 7, 7, 8, 7, 9, 8, 10, 9, 9, 8, 11, 8, 10, 10, 11, 10, 11, 10, 13, 10, 11, 8, 10, 10, 10, 11, 12, 11, 11, 11, 13, 11, 12, 11, 12, 12, 11, 11, 13, 12, 10, 8, 10, 9, 9, 12, 11, 10, 13, 10, 14, 14, 11, 11, 11, 11, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..17711 FORMULA a(n) = [x^n y^5] 1/Product_{j>=2} (1-y*x^A000045(j)). MAPLE h:= proc(n) option remember; `if`(n<1, 0, `if`((t->       issqr(t+4) or issqr(t-4))(5*n^2), n, h(n-1)))     end: b:= proc(n, i, t) option remember; `if`(n=0, 1, `if`(i<1 or       t<1, 0, b(n, h(i-1), t)+b(n-i, h(min(n-i, i)), t-1)))     end: a:= n-> (k-> b(n, h(n), k)-b(n, h(n), k-1))(5): seq(a(n), n=0..120); CROSSREFS Column k=5 of A319394. Cf. A000045. Sequence in context: A116648 A152850 A036714 * A260734 A265428 A035644 Adjacent sequences:  A319395 A319396 A319397 * A319399 A319400 A319401 KEYWORD nonn AUTHOR Alois P. Heinz, Sep 18 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 May 28 17:37 EDT 2020. Contains 334684 sequences. (Running on oeis4.)