This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Cases m = 3, 5, 7, 9, 11, 13, 15, 17, 19, 21 in A175442-A175451. LINKS 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 Cf. A175442-A175450. Sequence in context: A037003 A105907 A018696 * A004023 A186682 A031030 Adjacent sequences:  A175448 A175449 A175450 * A175452 A175453 A175454 KEYWORD nonn AUTHOR Zak Seidov, May 16 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 01:22 EDT 2018. Contains 311819 sequences. (Running on oeis4.)