|
Search: id:A003107
|
|
|
| A003107 |
|
Number of partitions of n into Fibonacci parts (with a single type of 1).
(Formerly M0556)
|
|
+0
9
|
|
| 1, 1, 2, 3, 4, 6, 8, 10, 14, 17, 22, 27, 33, 41, 49, 59, 71, 83, 99, 115, 134, 157, 180, 208, 239, 272, 312, 353, 400, 453, 509, 573, 642, 717, 803, 892, 993, 1102, 1219, 1350, 1489, 1640, 1808, 1983, 2178, 2386, 2609, 2854, 3113, 3393, 3697, 4017, 4367, 4737
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The partitions allow repeated items but the order of items is immaterial (1+2=2+1) - Ron Knott (ron(AT)ronknott.com), Oct 22 2003
A098641(n) = a(A000045(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Apr 24 2005
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..1000
|
|
FORMULA
|
a(n)=(1/n)*Sum_{k=1..n} A005092(k)*a(n-k), n > 1, a(0)=1. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 21 2002
G.f.: Product(1/(1-x^fibonacci(i)), i=2..infinity). - Ron Knott (ron(AT)ronknott.com), Oct 22 2003
|
|
EXAMPLE
|
a(4)=4 since the 4 partitions of 4 using only Fibonacci numbers, reptitions allowed, are 1+1+1+1, 2+2, 2+1+1, 3+1
|
|
MATHEMATICA
|
CoefficientList[ Series[1/ Product[1 - x^Fibonacci[i], {i, 2, 21}], {x, 0, 53}], x] (from Robert G. Wilson v (rgwv(at)rgwv.com), Mar 28 2006)
|
|
CROSSREFS
|
Cf. A007000, A005092, A003107, A028290 (where the only Fibonacci numbers allowed are 1, 2, 3, 5 and 8).
Cf. A102848.
Adjacent sequences: A003104 A003105 A003106 this_sequence A003108 A003109 A003110
Sequence in context: A027589 A039851 A028290 this_sequence A014977 A008583 A053253
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Herman P. Robinson
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 21 2002
|
|
|
Search completed in 0.002 seconds
|
