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 A279948 #30 Dec 25 2016 02:44:02
%S A279948 0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,3,0,0,0,0,3,0,0,0,0,1,0,0,0,0,0,3,
%T A279948 0,0,0,0,6,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,3,0,0,3,0,3,0,0,6,0,0,0,0,3,
%U A279948 0,0,0,0,0,0,0,1,0,0,6,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3
%N A279948 Expansion of (Sum_{k>=1} x^(prime(k)^2))^3.
%C A279948 Number of ordered ways of writing n as the sum of three squares of primes (A001248).
%H A279948 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A279948 G.f.: (Sum_{k>=1} x^(prime(k)^2))^3.
%e A279948 a(22) = 3 because we have [4, 9, 9], [9, 4, 9] and [9, 9, 4].
%t A279948 nmax = 125; CoefficientList[Series[(Sum[x^Prime[k]^2, {k, 1, nmax}])^3, {x, 0, nmax}], x]
%Y A279948 Cf. A001248, A063691, A098238.
%K A279948 nonn
%O A279948 0,18
%A A279948 _Ilya Gutkovskiy_, Dec 24 2016