|
Search: id:A000119
|
|
|
| A000119 |
|
Number of representations of n as a sum of distinct Fibonacci numbers.
(Formerly M0101 N0037)
|
|
+0
17
|
|
| 1, 1, 1, 2, 1, 2, 2, 1, 3, 2, 2, 3, 1, 3, 3, 2, 4, 2, 3, 3, 1, 4, 3, 3, 5, 2, 4, 4, 2, 5, 3, 3, 4, 1, 4, 4, 3, 6, 3, 5, 5, 2, 6, 4, 4, 6, 2, 5, 5, 3, 6, 3, 4, 4, 1, 5, 4, 4, 7, 3, 6, 6, 3, 8, 5, 5, 7, 2, 6, 6, 4, 8, 4, 6, 6, 2, 7, 5, 5, 8, 3, 6, 6, 3, 7, 4, 4, 5, 1, 5, 5, 4, 8, 4, 7, 7, 3, 9, 6, 6, 9, 3, 8, 8, 5
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Number of partitions into distinct Fibonacci parts (1 counted as single Fibonacci number)
Inverse Euler transform of sequence has generating function sum_{n>1} x^F(n)-x^{2F(n)} where F() are the Fibonacci numbers.
A065033(n) = a(A000045(n)).
|
|
REFERENCES
|
J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498, in the issue dedicated to Aldo De Luca on the occasion of his 60-th anniversary.
M. Bicknell-Johnson, pp. 53-60 in 'Applications of Fibonacci Numbers', volume 8, ed: F T Howard, Kluwer (1999); see Theorem 3.
A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci Association, San Jose, CA, 1972, p. 54.
D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, Fib. Quart., 4 (1966), 289-306 and 322.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 0..6765
Jean Berstel, Home Page
Ron Knott Sumthing about Fibonacci Numbers
J. Shallit, Number theory and formal languages, in D. A. Hejhal, J. Friedman, M. C. Gutzwiller, and A. M. Odlyzko, eds., Emerging Applications of Number Theory, IMA Volumes in Mathematics and Its Applications, V. 109, Springer-Verlag, 1999, pp. 547-570. (Eq. 9.2.)
|
|
FORMULA
|
a(n) = (1/n)*Sum_{k=1..n} b(k)*a(n-k), b(k) = Sum_{f} (-1)^(k/f+1)*f, where the last sum is taken over all Fibonacci numbers f dividing k. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 28 2002
a(n)= 1, if n=0, 1, 2; a(n)= a(fib(i-2)+k)+a(k) if n>2 and 0<=k<=fib(i-3); a(n)= 2*a(k) if n>2 and fib(i-3)<=k<=fib(i-2); a(n)= a(fib(i+1)-2-k) otherwise where fib(i) is largest Fibonacci number (A000045) <= n and k=n-fib(i). [Bicknell-Johnson] - Ron Knott (ron(AT)ronknott.com), Dec 06 2004
|
|
MAPLE
|
with(combinat): p := product((1+x^fibonacci(i)), i=2..25): s := series(p, x, 1000): for k from 0 to 250 do printf(`%d, `, coeff(s, x, k)) od:
|
|
MATHEMATICA
|
CoefficientList[ Normal@Series[ Product[ 1+z^Fibonacci[ k ], {k, 2, 13} ], {z, 0, 233} ], z ]
|
|
PROGRAM
|
(PARI) a(n)=local(A, m, f); if(n<0, 0, A=1+x*O(x^n); m=2; while((f=fibonacci(m))<=n, A*=1+x^f; m++); polcoeff(A, n))
|
|
CROSSREFS
|
Cf. A007000, A003107, A000121. Least inverse is A013583.
Adjacent sequences: A000116 A000117 A000118 this_sequence A000120 A000121 A000122
Sequence in context: A095686 A105258 A109967 this_sequence A097368 A109699 A029283
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms and Maple program from James A. Sellers (sellersj(AT)math.psu.edu), May 29 2000
|
|
|
Search completed in 0.002 seconds
|
