This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A280168 #4 Dec 27 2016 23:22:19
%S A280168 1,1,1,1,2,2,2,2,3,4,4,4,5,6,6,6,7,8,9,9,10,11,12,12,13,15,16,17,18,
%T A280168 20,21,22,23,25,27,28,30,32,34,35,37,39,41,43,45,48,50,52,54,57,60,62,
%U A280168 65,68,72,74,77,80,84,87,90,94,98,102,106,110,114,118,123,127,132,136,142,147,152,157,163,169,174,180,186,193,199
%N A280168 Expansion of Product_{k>=2} 1/(1 - x^(Fibonacci(k)^2)).
%C A280168 Number of partitions of n into squares of Fibonacci numbers (with a single type of 1).
%H A280168 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%H A280168 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A280168 G.f.: Product_{k>=2} 1/(1 - x^(Fibonacci(k)^2)).
%e A280168 a(8) = 3 because we have [4, 4], [4, 1, 1, 1, 1] and [1, 1, 1, 1, 1, 1, 1, 1].
%t A280168 CoefficientList[Series[Product[1/(1 - x^Fibonacci[k]^2), {k, 2, 20}], {x, 0, 82}], x]
%Y A280168 Cf. A000119, A000121, A001156, A003107, A007000, A007598, A238999, A239002.
%K A280168 nonn
%O A280168 0,5
%A A280168 _Ilya Gutkovskiy_, Dec 27 2016