

A073609


a(0) = 2; a(n) for n > 0 is the smallest prime greater than a(n1) that differs from a(n1) by a square.


11



2, 3, 7, 11, 47, 83, 227, 263, 587, 911, 947, 983, 1019, 1163, 1307, 1451, 1487, 1523, 1559, 2459, 3359, 4259, 4583, 5483, 5519, 5843, 5879, 6203, 6779, 7103, 7247, 7283, 7607, 7643, 8219, 8363, 10667, 11243, 11279, 11423, 12323, 12647, 12791, 13367
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

For n > 2, a(n) must be of the form 36k + 11. This is seen by induction since 36k + 11 + m^2 is even if m is odd and since 36k + 11 + (6m + 2)^2 and 36k + 11 + (6m + 4)^2 are both divisible by 3.  Gerald McGarvey, Jun 03 2007


LINKS

Zak Seidov, Table of n, a(n) for n = 0..1000


EXAMPLE

After 3, we skip over 5 because 5  3 = 2, which is not a square, but 7  3 = 4 = 2^2, so 7 follows 3 in the sequence.
11 is the next prime after 7 and it differs from 7 by 4, so 11 follows 7 in the sequence.
47 differs from 11 by 36 = 6^2 and no prime between 11 and 47 differs from 11 by a square, so 47 is the next term after 11.


MATHEMATICA

p = 11; s2 = Join[{2, 3, 7, 11}, Table[x = 6; While[!PrimeQ[a = p + x^2], x = x + 6]; p = a, {99}]] (* Murthy *)
nxt[n_] := Module[{np = NextPrime[n]}, While[!IntegerQ[Sqrt[np  n]], np = NextPrime[np]]; np]; NestList[nxt, 2, 50] (* Harvey P. Dale, Mar 13 2013 *)


PROG

(PARI) print1(a=2, ", "); for(n=1, 43, k=1; while(!isprime(b=a+k^2), k++); print1(a=b, ", "))


CROSSREFS

Cf. A217840.
Sequence in context: A056292 A106125 A175171 * A267091 A053781 A066749
Adjacent sequences: A073606 A073607 A073608 * A073610 A073611 A073612


KEYWORD

nonn


AUTHOR

Amarnath Murthy, Aug 05 2002


EXTENSIONS

Edited and extended by Klaus Brockhaus, Aug 07 2002


STATUS

approved



