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 A067595 #20 Apr 04 2020 10:22:00
%S A067595 1,1,1,2,2,2,2,3,2,2,3,3,3,3,4,3,3,3,4,3,3,5,4,4,4,5,3,3,4,4,4,4,6,5,
%T A067595 5,5,6,4,4,6,5,5,5,6,4,4,4,5,4,4,7,6,6,6,8,5,5,7,6,6,6,8,6,6,6,7,5,5,
%U A067595 8,6,6,6,7,4,4,5,5,5,5,8,7,7,7,9,6,6,9,8,8,8,10,7,7,7,8,6,6,10,8,8,8,10,6,6,8
%N A067595 Number of partitions of n into distinct Lucas parts (A000032).
%H A067595 Alois P. Heinz, <a href="/A067595/b067595.txt">Table of n, a(n) for n = 0..15127</a>
%F A067595 G.f.: B(x) * (1 + x^2) where B(x) is the g.f. of A003263. [_Joerg Arndt_, Jul 14 2013]
%t A067595 n1 = 10; n2 = LucasL[n1]; (1 + x^2)*Product[1 + x^LucasL[n], {n, 1, n1}] + O[x]^n2 // CoefficientList[#, x]& (* _Jean-François Alcover_, Feb 17 2017, after _Joerg Arndt_ *)
%o A067595 (PARI)
%o A067595 L(n) = fibonacci(n+1) + fibonacci(n-1);
%o A067595 N = 66; x = 'x + O('x^N);
%o A067595 gf = prod(n=0, 11, 1 + x^L(n) );
%o A067595 \\gf = prod(n=1, 11, 1 + x^L(n) ) * (1+x^2); \\ same g.f.
%o A067595 Vec(gf) \\ _Joerg Arndt_, Jul 14 2013
%Y A067595 Cf. A000032, A000119.
%K A067595 easy,nonn,look
%O A067595 0,4
%A A067595 _Naohiro Nomoto_, Jan 31 2002
%E A067595 Corrected a(0), _Joerg Arndt_, Jul 14 2013