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!)
 A175444 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=7. 1

%I

%S 2,5,23,47,79,89,107,131,149,173,191,229,233,257,317,383,401,439,443,

%T 467,499,509,541,593,653,677,709,719,751,761,821,859,863,887,919,929,

%U 947,971,1031,1069,1087,1097,1129,1153,1171,1181,1213,1223,1283,1307

%N a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=7.

%H Harvey P. Dale, <a href="/A175444/b175444.txt">Table of n, a(n) for n = 1..1000</a>

%t nxt[n_]:=Module[{sp=NextPrime[n]},While[!Divisible[n+sp,7],sp = NextPrime[ sp]]; sp]; NestList[nxt,2,50] (* _Harvey P. Dale_, Sep 26 2012 *)

%Y Cf. A175451.

%K nonn

%O 1,1

%A _Zak Seidov_, May 28 2010

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 September 29 15:17 EDT 2020. Contains 337432 sequences. (Running on oeis4.)