login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A175451
a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=21.
11
2, 19, 23, 61, 107, 229, 233, 271, 317, 397, 401, 439, 443, 523, 569, 607, 653, 691, 821, 859, 863, 1069, 1283, 1321, 1367, 1447, 1451, 1489, 1493, 1531, 1619, 1657, 1787, 1867, 1871, 1951, 1997, 2161, 2207, 2287, 2333, 2371, 2417, 2539, 2543, 2707, 2711
OFFSET
1,1
COMMENTS
Cases m = 3, 5, 7, 9, 11, 13, 15, 17, 19, 21 in A175442-A175451.
MATHEMATICA
a=2; s={a}; k=2; m=21; Do[p=Prime[k]; If[Mod[a+p, m]==0, a=p; AppendTo[s, a]]; k++, {1000}]; s
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, May 16 2010
STATUS
approved