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!)
A358008 Number of partitions of n into 8 distinct positive Fibonacci numbers (with a single type of 1). 4
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
87
LINKS
EXAMPLE
a(87) = 1 as 87 = 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34. - David A. Corneth, Oct 24 2022
PROG
(PARI) first(n)= my(res = vector(n + 86), v = [1..8], l = List()); for(i = 2, oo, c = fibonacci(i); if(c <= n + 86, listput(l, c) , break ) ); forvec(x = vector(8, i, [1, #l]), c = sum(i = 1, #x, l[x[i]]); if(c <= #res, res[c]++ ) , 2 ); vector(#res - 86, i, res[i + 86]) \\ David A. Corneth, Oct 24 2022
CROSSREFS
Sequence in context: A178334 A000007 A240351 * A249832 A014041 A359465
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 April 28 23:48 EDT 2024. Contains 372097 sequences. (Running on oeis4.)