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 A111900 #30 Jan 09 2023 13:02:40
%S A111900 1,0,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,
%T A111900 1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,
%U A111900 0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,1,0,0,0
%N A111900 Number of partitions of n into distinct squares of primes.
%C A111900 a(n) <= 1 for n < 410.
%H A111900 Alois P. Heinz, <a href="/A111900/b111900.txt">Table of n, a(n) for n = 0..20000</a>
%H A111900 Alois P. Heinz, <a href="/A111900/a111900.jpg">Plot of the first 100000 terms</a>
%H A111900 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A111900 G.f.: Product_{k>=1} (1 + x^(prime(k)^2)). - _Ilya Gutkovskiy_, Dec 26 2016
%e A111900 G.f. = 1 + x^4 + x^9 + x^13 + x^25 + x^29 + x^34 + x^38 + x^49 + x^53 + x^58 + x^62 + ...
%e A111900 410 = 7^2 + 19^2 = 11^2 + 17^2, therefore a(410)=2.
%t A111900 nmax = 100; CoefficientList[Series[Product[1 + x^Prime[k]^2, {k, 1, nmax}], {x, 0, nmax}], x] (* _Ilya Gutkovskiy_, Jun 15 2017 *)
%o A111900 (PARI) {a(n) = if(n < 0, 0, polcoeff( prod(k=1, primepi(sqrtint(n)), 1 + x^prime(k)^2 + x*O(x^n)), n))}; /* _Michael Somos_, Dec 26 2016 */
%Y A111900 Cf. A090677, A001248, A033461, A106244, A111902, A287965.
%K A111900 nonn,look
%O A111900 0,411
%A A111900 _Reinhard Zumkeller_, Aug 20 2005