login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A279948
Expansion of (Sum_{k>=1} x^(prime(k)^2))^3.
0
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, 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, 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
OFFSET
0,18
COMMENTS
Number of ordered ways of writing n as the sum of three squares of primes (A001248).
FORMULA
G.f.: (Sum_{k>=1} x^(prime(k)^2))^3.
EXAMPLE
a(22) = 3 because we have [4, 9, 9], [9, 4, 9] and [9, 9, 4].
MATHEMATICA
nmax = 125; CoefficientList[Series[(Sum[x^Prime[k]^2, {k, 1, nmax}])^3, {x, 0, nmax}], x]
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Dec 24 2016
STATUS
approved