The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,18 COMMENTS Number of ordered ways of writing n as the sum of three squares of primes (A001248). LINKS 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 Cf. A001248, A063691, A098238. Sequence in context: A320179 A035656 A325675 * A264009 A281155 A321432 Adjacent sequences:  A279945 A279946 A279947 * A279949 A279950 A279951 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Dec 24 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 06:44 EST 2020. Contains 338868 sequences. (Running on oeis4.)