|
Search: id:A103563
|
|
|
| A103563 |
|
Number of partitions of n into even-subscripted Fibonacci numbers (1,3,8,21,55,144,...). |
|
+0
1
|
|
| 1, 1, 1, 2, 2, 2, 3, 3, 4, 5, 5, 6, 7, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 21, 22, 23, 26, 27, 29, 32, 33, 36, 39, 40, 43, 46, 48, 51, 54, 57, 60, 64, 67, 70, 75, 78, 81, 87, 90, 94, 100, 103, 108, 114, 118, 124, 130, 135, 141, 147, 153, 159, 167, 174, 180, 189, 196, 202
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Euler transform of the characteristic function of the even-subscripted Fibonacci numbers.
|
|
FORMULA
|
G.f.=1/product((1-x^fibonacci(2k)), k=1..infinity).
|
|
EXAMPLE
|
a(8)=4 because we have 8, 3+3+1+1, 3+1+1+1+1+1, and 1+1+1+1+1+1+1+1.
|
|
CROSSREFS
|
Cf. A001906, A089197.
Sequence in context: A029098 A074286 A025769 this_sequence A008625 A029148 A067842
Adjacent sequences: A103560 A103561 A103562 this_sequence A103564 A103565 A103566
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 23 2005
|
|
|
Search completed in 0.002 seconds
|
