|
Search: id:A103577
|
|
|
| A103577 |
|
Number of partitions of n into Fibonacci parts if each part is of two kinds. |
|
+0
1
|
|
| 1, 2, 5, 10, 18, 32, 53, 84, 132, 198, 294, 426, 606, 852, 1178, 1610, 2178, 2910, 3859, 5066, 6598, 8534, 10951, 13968, 17705, 22304, 27959, 34852, 43239, 53402, 65649, 80384, 98025, 119078, 144149, 173866, 209033, 250510, 299283, 356532, 423508
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Euler transform of 2 x the characteristic function of the Fibonacci numbers.
|
|
FORMULA
|
G.f.=1/product((1-x^fibonacci(i))^2, i=2..infinity).
|
|
EXAMPLE
|
a(3)=10 because we have 3, 3', 2+1, 2+1', 2'+1, 2'+1', 1+1+1, 1+1+1', 1+1'+1' and 1'+1'+1'.
|
|
CROSSREFS
|
Cf. A003107, A000045.
Sequence in context: A084835 A034350 A006327 this_sequence A079006 A001936 A127297
Adjacent sequences: A103574 A103575 A103576 this_sequence A103578 A103579 A103580
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 23 2005
|
|
|
Search completed in 0.002 seconds
|
