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”).

A178468
a(n) = smallest prime > a(n-1) such that a(n)+a(n-1) is multiple of k, a(1)=2, k=101.
3
2, 503, 709, 907, 911, 1109, 2729, 2927, 3739, 4139, 4547, 5351, 5557, 6361, 6971, 7573, 7577, 8179, 10607, 11411, 11617, 12421, 12829, 13229, 14243, 15451, 15859, 16057, 16061, 17471, 19697, 21107, 21313, 21713, 22727, 23531, 26161, 26561
OFFSET
1,1
LINKS
EXAMPLE
2+503=505=5*101, 503+709=1212=12*101, 709+907=1616=16*101.
MATHEMATICA
k=101; a=p=2; s={2}; Do[p=NextPrime[p]; If[Mod[a+p, k]==0, a=p; AppendTo[s, a]], {10000}]; s
sp[n_]:=Module[{p=NextPrime[n]}, While[Mod[n+p, 101]!=0, p=NextPrime[p]]; p]; NestList[sp, 2, 40] (* Harvey P. Dale, Sep 25 2019 *)
CROSSREFS
Cf. A178429 - A178467 cases k=23(2)99, A175442 - A175451 cases k=3(2)21.
Sequence in context: A027655 A220859 A322759 * A024032 A172232 A253706
KEYWORD
nonn
AUTHOR
Zak Seidov, May 28 2010
STATUS
approved