|
%I #6 Jan 11 2017 03:24:00
%S 1,1,0,0,1,1,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1,0,0,0,
%T 1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,
%U 1,1,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0,0
%N Expansion of Product_{k>=2} (1 + x^(Fibonacci(k)^2)).
%C Number of partitions of n into distinct squares of Fibonacci numbers (with a single type of 1).
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%H <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F G.f.: Product_{k>=2} (1 + x^(Fibonacci(k)^2)).
%e a(10) = 1 because we have [9, 1].
%t CoefficientList[Series[Product[1 + x^Fibonacci[k]^2, {k, 2, 20}], {x, 0, 105}], x]
%Y Cf. A000119, A000121, A003107, A007598, A239002, A033461, A280168.
%K nonn
%O 0
%A _Ilya Gutkovskiy_, Jan 11 2017
|
