|
|
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).
|
|
0
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|