login
This site is supported by donations to The OEIS Foundation.
Logo

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; internal format)
OFFSET

0,17

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 (rgwv(AT)rgwv.com), Sep 21 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.