The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175445 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=9. 1
 2, 7, 11, 43, 47, 61, 83, 97, 101, 151, 173, 223, 227, 241, 263, 277, 281, 313, 317, 331, 353, 367, 389, 421, 443, 457, 461, 547, 569, 601, 641, 673, 677, 691, 821, 853, 857, 907, 911, 997, 1019, 1033, 1091, 1123, 1163, 1213, 1217, 1231, 1289, 1303, 1307 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA nxt[n_]:=Module[{c=NextPrime[n]}, While[!Divisible[n+c, 9], c= NextPrime[ c]]; c]; NestList[nxt, 2, 60] (* Harvey P. Dale, Feb 18 2012 *) CROSSREFS Cf. A175451. Sequence in context: A297348 A023250 A106013 * A073623 A101592 A135066 Adjacent sequences:  A175442 A175443 A175444 * A175446 A175447 A175448 KEYWORD nonn AUTHOR Zak Seidov, May 28 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 1 17:45 EDT 2020. Contains 337444 sequences. (Running on oeis4.)