A080898 a(1)=2; for n>1, a(n+1) = least prime > a(n) and congruent to a prime modulo prime successor of a(n).

2, 5, 17, 41, 89, 197, 401, 821, 1657, 3329, 6673, 13381, 13399, 26833, 53681, 107453, 214939, 429889, 429901, 859861, 1719799, 3439663, 6879361, 13758803, 27517687, 55035401, 110070833, 110070889, 220141829, 440283691, 880567447, 1761135029, 3522270079

Offset

1,1

Links

Table of n, a(n) for n=1..33.

Example

n=2: prime successor of a(2-1)=2 is 3: 5 mod 3 = 2 is prime, therefore a(2)=5;
n=3: prime successor of a(3-1)=5 is 7: 11 mod 7 = 4, 13 mod 7 = 6, 17 mod 7 = 3 is prime, therefore a(3)=17.

Crossrefs

Sequence in context: A263638 A118500 A323427 * A346134 A081763 A013918

Adjacent sequences: A080895 A080896 A080897 * A080899 A080900 A080901

Keyword

nonn,easy

Author

Reinhard Zumkeller, Mar 31 2003

Extensions

a(21)-a(25) from Sam Alexander, Feb 28 2005

a(26)-a(33) from Sean A. Irvine, Oct 02 2025

Status

approved