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 A280126 #8 Dec 27 2016 13:23:40
%S A280126 1,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,0,1,0,0,0,1,0,0,0,1,0,1,0,1,0,1,0,1,
%T A280126 1,1,1,1,1,1,1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,1,0,1,2,1,0,1,1,1,0,
%U A280126 0,1,1,0,0,1,1,0,1,0,1,0,1,0,1,1,1,1,1,1,1,1,0,1,0,1,0,1,0,1
%N A280126 Expansion of Product_{k>=1} (1 + x^(prime(k)^2))*(1 + x^(prime(k)^3)).
%C A280126 Number of partitions of n into distinct parts that are squares of primes (A001248) or cubes of primes (A030078).
%H A280126 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A280126 G.f.: Product_{k>=1} (1 + x^(prime(k)^2))*(1 + x^(prime(k)^3)).
%e A280126 a(61) = 2 because we have [49, 8, 4] and [25, 27, 9].
%t A280126 nmax = 120; CoefficientList[Series[Product[(1 + x^Prime[k]^2) (1 + x^Prime[k]^3), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A280126 Cf. A000586, A001248, A030078, A106244, A111900, A111902, A131799, A168363, A280125.
%K A280126 nonn
%O A280126 0,62
%A A280126 _Ilya Gutkovskiy_, Dec 26 2016