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 A280125 #10 Dec 27 2016 13:23:10
%S A280125 1,0,0,0,1,0,0,0,2,1,0,0,2,1,0,0,3,2,1,0,3,2,1,0,4,4,2,2,4,4,2,2,5,6,
%T A280125 4,4,7,6,4,4,8,8,6,7,10,10,6,7,11,13,9,10,15,15,12,10,16,18,16,14,20,
%U A280125 22,19,17,21,25,23,22,26,29,28,25,30,32,33,31,37,38,38,37
%N A280125 Expansion of Product_{k>=1} 1/((1 - x^(prime(k)^2))*(1 - x^(prime(k)^3))).
%C A280125 Number of partitions of n into parts that are squares of primes (A001248) or cubes of primes (A030078).
%H A280125 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A280125 G.f.: Product_{k>=1} 1/((1 - x^(prime(k)^2))*(1 - x^(prime(k)^3))).
%e A280125 a(16) = 3 because we have [8, 8], [8, 4, 4] and [4, 4, 4, 4].
%t A280125 nmax = 100; CoefficientList[Series[Product[1/((1 - x^Prime[k]^2) (1 - x^Prime[k]^3)), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A280125 Cf. A000607, A001248, A023893, A030078, A090677, A111901, A131799, A168363, A279760, A280126.
%K A280125 nonn
%O A280125 0,9
%A A280125 _Ilya Gutkovskiy_, Dec 26 2016