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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097876 Number of ways to partition n into sums of squares of nonprimes. 0
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 12, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,17 LINKS EXAMPLE a(36)=4 because 36={36 ones}, {16 ones, 16}, {7 ones, 25} & {16, 16}. MATHEMATICA nonprime[n_] := FixedPoint[n + PrimePi[ # ] &, n + PrimePi[n]]; CoefficientList[ Series[ Product[1/(1 - x^nonprime[i]^2), {i, 111}], {x, 0, 101}], x] CROSSREFS Cf. A090677. Sequence in context: A054900 A046042 A071841 * A177830 A111859 A156822 Adjacent sequences:  A097873 A097874 A097875 * A097877 A097878 A097879 KEYWORD nonn AUTHOR Robert G. Wilson v, Sep 21 2004 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 5 00:21 EST 2021. Contains 349530 sequences. (Running on oeis4.)