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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085902 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. 1
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; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

It can easily be proved that a(n) == 3 mod 4 for all n >2.

LINKS

Table of n, a(n) for n=0..48.

CROSSREFS

Cf. A077224.

Sequence in context: A051101 A045339 A051091 * A051083 A051097 A214773

Adjacent sequences:  A085899 A085900 A085901 * A085903 A085904 A085905

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 09 2003

EXTENSIONS

More terms from Ray Chandler, Sep 13 2003

STATUS

approved

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 May 24 01:37 EDT 2013. Contains 225613 sequences.