Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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
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
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 24 2022
STATUS
approved