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 A281449 #20 Jan 29 2017 01:39:42
%S A281449 0,0,0,1,0,0,0,2,1,0,0,3,2,0,0,4,3,2,0,5,4,3,0,6,6,4,3,7,8,5,4,8,10,8,
%T A281449 5,13,12,10,6,15,14,12,10,17,21,14,12,19,25,18,14,25,29,27,16,28,33,
%U A281449 33,21,31,42,38,31,34,47,43,38,41,52,54,43,53,57,62,51,62,67,69,64,68,82,76,74,78,94,89,82,93
%N A281449 Expansion of Sum_{k>=1} x^(prime(k)^2)/(1 - x^(prime(k)^2)) / Product_{k>=1} (1 - x^(prime(k)^2)).
%C A281449 Total number of parts in all partitions of n into squares of primes (A001248).
%C A281449 Convolution of A056170 and A090677.
%H A281449 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A281449 G.f.: Sum_{k>=1} x^(prime(k)^2)/(1 - x^(prime(k)^2)) / Product_{k>=1} (1 - x^(prime(k)^2)).
%e A281449 a(25) = 6 because we have [25], [9, 4, 4, 4, 4] and 1 + 5 = 6.
%t A281449 nmax = 88; Rest[CoefficientList[Series[Sum[x^Prime[k]^2/(1 - x^Prime[k]^2), {k, 1, nmax}]/Product[1 - x^Prime[k]^2, {k, 1, nmax}], {x, 0, nmax}], x]]
%Y A281449 Cf. A001248, A056170, A084993, A090677, A281541.
%K A281449 nonn
%O A281449 1,8
%A A281449 _Ilya Gutkovskiy_, Jan 27 2017