|
%I #14 Oct 25 2022 01:38:24
%S 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,
%T 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,
%U 1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0
%N Number of partitions of n into 8 distinct positive Fibonacci numbers (with a single type of 1).
%H David A. Corneth, <a href="/A358008/b358008.txt">Table of n, a(n) for n = 87..10086</a>
%e a(87) = 1 as 87 = 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34. - _David A. Corneth_, Oct 24 2022
%o (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
%Y Cf. A000045, A000119, A319401, A357716, A357722, A357731, A357732, A358005, A358006, A358007.
%K nonn
%O 87
%A _Ilya Gutkovskiy_, Oct 24 2022
|
