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!)
A357694 Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1). 4
1, 7, 28, 77, 168, 308, 504, 750, 1050, 1400, 1813, 2261, 2737, 3227, 3753, 4312, 4921, 5579, 6230, 6832, 7413, 8008, 8652, 9289, 9996, 10654, 11361, 12061, 12853, 13657, 14357, 14924, 15393, 15869, 16408, 16933, 17689, 18319, 18949, 19537, 20244, 21049, 21728 (list; graph; refs; listen; history; text; internal format)
OFFSET
7,2
LINKS
FORMULA
G.f.: ( Sum_{k>=2} x^Fibonacci(k) )^7.
a(n) = A121548(n,7).
MATHEMATICA
nmax = 49; CoefficientList[Series[Sum[x^Fibonacci[k], {k, 2, 21}]^7, {x, 0, nmax}], x] // Drop[#, 7] &
CROSSREFS
Sequence in context: A296986 A211899 A073995 * A341986 A341067 A061968
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 September 17 09:48 EDT 2024. Contains 375987 sequences. (Running on oeis4.)