The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A224223 a(0)=2; for n>0, a(n) = smallest prime not occurring earlier in the sequence such that a(n-1)+a(n) is a multiple of n^2. If no such prime exists, the sequence terminates. 3
 2, 3, 5, 13, 19, 31, 41, 449, 127, 197, 103, 139, 149, 1879, 277, 173, 83, 5119, 389, 1777, 223, 659, 1277, 839, 313, 937, 1091, 367, 1201, 5527, 773, 4993, 1151, 7561, 2843, 4507, 677, 4799, 977, 5107, 4493, 15679, 7253, 26029, 3011, 1039, 5309, 3527 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Is this sequence infinite and, if so, is it a permutation of the primes? The answers are probably Yes and No (7 has not appeared after 10000 terms). Compare A134204. LINKS N. J. A. Sloane, Table of n, a(n) for n = 0..9999 CROSSREFS Cf. A134204, A224221, A224222, A224229. Sequence in context: A164958 A145908 A173830 * A238497 A061305 A177374 Adjacent sequences: A224220 A224221 A224222 * A224224 A224225 A224226 KEYWORD nonn,look AUTHOR Daniel Drucker and N. J. A. Sloane, Apr 05 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 18:55 EST 2022. Contains 358475 sequences. (Running on oeis4.)