|
| |
|
|
A093997
|
|
Number of partitions of n with an odd number of distinct Fibonacci parts.
|
|
1
| |
|
|
0, 1, 1, 1, 0, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 3, 1, 2, 2, 1, 2, 2, 2, 2, 0, 2, 2, 1, 3, 2, 3, 2, 1, 3, 2, 2, 3, 1, 2, 3, 2, 3, 1, 2, 2, 0, 3, 2, 2, 3, 2, 3, 3, 2, 4, 2, 2, 4, 1, 3, 3, 2, 4, 2, 3, 3, 1, 3, 3, 3, 4, 1, 3, 3, 1, 4, 2, 2, 2, 1, 3, 2, 2, 4, 2, 3, 4, 2, 4, 3, 3, 5, 1, 4, 4, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,9
|
|
|
FORMULA
| G.f.: (prod_{k=2..inf} (1 + x^{F_k}) - prod_{k=2..inf} (1 - x^{F_k}))/2
|
|
|
MATHEMATICA
| Take[ CoefficientList[ Expand[ Product[1 + x^Fibonacci[k], {k, 2, 13}]/2 - Product[1 - x^Fibonacci[k], {k, 2, 13}]/2], x], 105] (from Robert G. Wilson v May 29 2004)
|
|
|
CROSSREFS
| Cf. A000119.
Sequence in context: A072170 A056624 A193348 * A157196 A063014 A097295
Adjacent sequences: A093994 A093995 A093996 * A093998 A093999 A094000
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Naoki Sato (nsato7(AT)yahoo.ca), May 24 2004
|
|
|
EXTENSIONS
| Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), May 29 2004
|
| |
|
|