id:A085902 - OEIS Search Results

Search: id:A085902

Displaying 1-1 of 1 results found.

page 1

a(1)=2, a(n) = smallest squarefree number >a(n-1) such that the sum a(n) +a(i) for all i = 1 to (n-1) is squarefree. Or sum of any two terms is a squarefree number.

+0
2

2, 3, 11, 19, 55, 59, 83, 111, 127, 155, 163, 199, 203, 219, 263, 299, 307, 311, 371, 383, 399, 455, 515, 803, 883, 919, 983, 1063, 1499, 1559, 1927, 2019, 2063, 2183, 2215, 2271, 2359, 2503, 2703, 2755, 2999, 3459, 3899, 3927, 4271, 4303, 4411, 4519, 4559 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`It can easily be proved that a(n) == 3 mod 4 for all n >2.`
	CROSSREFS	`Cf. A077224.` `Sequence in context: A051101 A045339 A051091 this_sequence A051083 A051097 A076201` `Adjacent sequences: A085899 A085900 A085901 this_sequence A085903 A085904 A085905`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 09 2003`
	EXTENSIONS	`More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 13 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research