login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175447 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=13. 1

%I #4 Sep 24 2016 15:36:39

%S 2,11,41,89,197,271,353,401,431,479,509,557,587,661,691,739,743,947,

%T 977,1051,1237,1259,1289,1493,1523,1571,1601,1753,1783,1831,1861,1987,

%U 2017,2039,2069,2143,2251,2273,2381,2663,2693,2741,2797,2819,2927,3001,3083

%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=13.

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

%t sp[n_]:=Module[{p=NextPrime[n]},While[!Divisible[p+n,13],p= NextPrime[ p]]; p]; NestList[sp,2,50] (* _Harvey P. Dale_, Sep 24 2016 *)

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 21:46 EDT 2024. Contains 375417 sequences. (Running on oeis4.)