STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A239002
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Number of partitions of n into distinct parts all of which are Fibonacci numbers greater than 1.
(history; published version)
(history; published version)
KEYWORD
nonn,easy,look,new
STATUS
approved
editing
STATUS
editing
approved
FORMULA
G.f.: Product_{i>=3} (1+x^Fibonacci(i)). - Alois P. Heinz, Mar 15 2014
MAPLE
F:= combinat[fibonacci]:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<3, 0,
b(n, i-1)+`if`(F(i)>n, 0, b(n-F(i), i-1))))
end:
a:= proc(n) local j; for j from ilog[(1+sqrt(5))/2](n+1)
while F(j+1)<=n do od; b(n, j)
end:
seq(a(n), n=0..100); # Alois P. Heinz, Mar 15 2014
LINKS
Alois P. Heinz, <a href="/A239002/b239002.txt">Table of n, a(n) for n = 0..10946</a>
DATA
1, 0, 1, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0, 3, 0, 2, 2, 0, 3, 0, 1, 3, 0, 3, 2, 0, 4, 0, 2, 3, 0, 3, 1, 0, 4, 0, 3, 3, 0, 5, 0, 2, 4, 0, 4, 2, 0, 5, 0, 3, 3, 0, 4, 0, 1, 4, 0, 4, 3, 0, 6, 0, 3, 5, 0, 5, 2, 0, 6, 0, 4, 4, 0, 6, 0, 2, 5, 0, 5, 3, 0, 6, 0, 3, 4, 0, 4
STATUS
proposed
editing
STATUS
editing
proposed
STATUS
proposed
reviewed