login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A357717 Number of ways to write n as an ordered sum of nine positive Fibonacci numbers (with a single type of 1). 3
1, 9, 45, 156, 423, 954, 1878, 3321, 5409, 8251, 11979, 16686, 22446, 29250, 37134, 46107, 56259, 67671, 80407, 94338, 109269, 125118, 141930, 159723, 178608, 198522, 219510, 241338, 264438, 288810, 314550, 341010, 367785, 394596, 421443, 448650, 476614, 505404, 534978 (list; graph; refs; listen; history; text; internal format)
OFFSET
9,2
LINKS
FORMULA
G.f.: ( Sum_{k>=2} x^Fibonacci(k) )^9.
a(n) = A121548(n,9).
MATHEMATICA
nmax = 47; CoefficientList[Series[Sum[x^Fibonacci[k], {k, 2, 21}]^9, {x, 0, nmax}], x] // Drop[#, 9] &
CROSSREFS
Sequence in context: A212089 A212142 A095166 * A341988 A341069 A126899
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 10 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 07:08 EDT 2024. Contains 373540 sequences. (Running on oeis4.)