id:A097876 - OEIS Search Results

Search: id:A097876

Displaying 1-1 of 1 results found.

page 1

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, 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; listen)

	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 this_sequence A111859 A156822 A107609` `Adjacent sequences: A097873 A097874 A097875 this_sequence A097877 A097878 A097879`
	KEYWORD	`nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 21 2004`

page 1

Search completed in 0.002 seconds

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.

AT&T Labs Research