|
|
A290808
|
|
Number of partitions of n into distinct Pell parts (A000129).
|
|
3
|
|
|
1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Product_{k>=1} (1 + x^A000129(k)).
|
|
EXAMPLE
|
a(8) = 1 because we have [5, 2, 1].
|
|
MAPLE
|
N:= 200: # to get a(0) to a(N)
Pell:= gfun:-rectoproc({a(0)=0, a(1)=1, a(n+1)=2*a(n)+a(n-1)}, a(n), remember):
G:= 1:
for k from 1 while Pell(k) <= N do G:= G*(1+x^Pell(k)) od:
|
|
MATHEMATICA
|
CoefficientList[Series[Product[(1 + x^Fibonacci[k, 2]), {k, 1, 15}], {x, 0, 108}], x]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|