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!)
A358005 Number of partitions of n into 5 distinct positive Fibonacci numbers (with a single type of 1). 5
1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 3, 1, 2, 2, 1, 3, 2, 2, 2, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
19,27
LINKS
MAPLE
G:= mul(1+t*x^combinat:-fibonacci(k), k=2..21):
S:= coeff(expand(G), t, 5):
seq(coeff(S, x, i), i=19..110); # Robert Israel, Jan 06 2023
CROSSREFS
Sequence in context: A105522 A131774 A342626 * A078316 A207668 A293838
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 24 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 May 4 13:55 EDT 2024. Contains 372243 sequences. (Running on oeis4.)