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 A294204 #6 Oct 25 2017 08:27:41
%S A294204 1,0,1,1,1,1,1,2,0,2,1,2,1,2,2,1,2,1,3,0,3,2,2,2,2,3,0,3,1,3,1,3,3,2,
%T A294204 3,2,4,0,4,2,3,2,3,3,1,3,1,4,0,4,3,3,3,3,5,0,5,2,4,2,4,4,2,4,2,5,0,5,
%U A294204 3,3,3,3,4,0,4,1,4,1,4,4,3,4,3,6,0,6,3,5,3,5,5,2,5,2,6,0,6,4,4,4,4
%N A294204 Number of partitions of n into distinct Lucas parts (A000032) greater than 1.
%C A294204 Convolution of the sequences A067595 and A033999.
%H A294204 Ilya Gutkovskiy, <a href="/A294204/a294204.jpg">Extended graphical example</a>
%H A294204 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A294204 G.f.: (1 + x^2)*Product_{k>=2} (1 + x^Lucas(k)).
%e A294204 a(9) = 2 because we have [7, 2] and [4, 3, 2].
%t A294204 CoefficientList[Series[(1 + x^2) Product[1 + x^LucasL[k], {k, 2, 15}], {x, 0, 100}], x]
%Y A294204 Cf. A000032, A033999, A067593, A067595, A239002, A294203.
%K A294204 nonn
%O A294204 0,8
%A A294204 _Ilya Gutkovskiy_, Oct 24 2017