id:A100699 - OEIS Search Results

Search: id:A100699

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition n into two square-free numbers that are not prime.

+0
1

0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 2, 0, 0, 0, 2, 1, 1, 1, 1, 1, 0, 2, 2, 1, 1, 2, 2, 0, 1, 2, 5, 1, 0, 2, 4, 2, 1, 3, 4, 3, 0, 3, 5, 3, 1, 1, 6, 2, 2, 2, 6, 3, 1, 3, 5, 5, 0, 4, 4, 4, 3, 4, 7, 3, 3, 4, 9, 4, 1, 4, 7, 5, 3, 6, 7, 5, 0, 5, 9, 4, 3, 5, 9, 3, 4, 7, 11, 5, 2, 7, 9, 7, 2, 8, 10, 7, 3, 8, 10 (list; graph; listen)

	OFFSET	`1,16`
	COMMENT	`a(n) <= A071068(n).`
	EXAMPLE	`a(36) = #{1+35, 6+30, 10+26, 14+22, 15+21} = 5.`
	CROSSREFS	`Cf. A000469, A061358, A005117.` `Sequence in context: A088886 A137347 A024941 this_sequence A108921 A071548 A143063` `Adjacent sequences: A100696 A100697 A100698 this_sequence A100700 A100701 A100702`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 09 2004`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research