The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A357730 Number of ways to write n as an ordered sum of ten positive Fibonacci numbers (with a single type of 1). 0
 1, 10, 55, 210, 625, 1542, 3300, 6310, 11040, 17980, 27673, 40660, 57475, 78520, 104175, 134742, 170620, 212220, 260035, 314290, 374933, 441790, 514855, 594210, 680070, 772582, 871920, 977790, 1090680, 1210960, 1339417, 1475340, 1618020, 1766080, 1918785, 2076012 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,2 LINKS Table of n, a(n) for n=10..45. FORMULA G.f.: ( Sum_{k>=2} x^Fibonacci(k) )^10. a(n) = A121548(n,10). MATHEMATICA nmax = 45; CoefficientList[Series[Sum[x^Fibonacci[k], {k, 2, 21}]^10, {x, 0, nmax}], x] // Drop[#, 10] & CROSSREFS Cf. A000045, A076739, A121548, A121549, A121550, A319403, A357688, A357690, A357691, A357694, A357716, A357717. Sequence in context: A107352 A127761 A337898 * A341989 A341070 A244871 Adjacent sequences: A357727 A357728 A357729 * A357731 A357732 A357733 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Oct 11 2022 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 19 13:25 EDT 2024. Contains 372694 sequences. (Running on oeis4.)