id:A071068 - OEIS Search Results

Search: id:A071068

Displaying 1-1 of 1 results found.

page 1

Number of ways to write n as a sum of two unordered squarefree numbers.

+0
3

0, 1, 1, 2, 1, 2, 2, 3, 2, 2, 2, 4, 3, 3, 3, 5, 4, 4, 3, 6, 4, 5, 4, 7, 5, 5, 5, 7, 5, 5, 5, 8, 6, 7, 6, 11, 7, 7, 7, 11, 8, 8, 9, 13, 10, 8, 8, 13, 10, 8, 7, 14, 10, 10, 7, 13, 10, 11, 9, 15, 11, 11, 11, 15, 11, 11, 11, 18, 12, 13, 11, 21, 13, 14, 13, 20, 14, 13, 14, 20, 16, 13, 13, 22, 15 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`T. D. Noe, Table of n, a(n) for n = 1..10000`
	EXAMPLE	`12=1+11=2+10=5+7=6+6 hence a(12)=4`
	CROSSREFS	`Cf. A005117, A098235.` `Sequence in context: A057526 A033265 A096004 this_sequence A137735 A029363 A033922` `Adjacent sequences: A071065 A071066 A071067 this_sequence A071069 A071070 A071071`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 26 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research