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!)
A064026 Numbers n such that d(n) + d(n+1) + d(n+2) = 8, where d(n) = A001223. 2

%I #20 Dec 15 2017 17:35:36

%S 2,3,5,26,43,142,234,286,313,458,484,743,1167,1548,1823,1833,1867,

%T 2066,2151,2199,2362,2493,2789,3410,3718,4559,5251,5618,6317,6696,

%U 6899,7147,7590,7807,7932,8083,8602,9402,9517,9682,10438,11006,11239,11494,12618

%N Numbers n such that d(n) + d(n+1) + d(n+2) = 8, where d(n) = A001223.

%C Prime((a(n)) = 3, 5, 11, 101, 191, 821, 1481, 1871, 2081, starting with 11 on, all primes == 11 mod 30. - _Zak Seidov_, Jan 25 2013

%H Harry J. Smith and Zak Seidov, <a href="/A064026/b064026.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harry J. Smith)

%t t={}; Do[If[Prime[n + 3] == Prime[n] + 8, AppendTo[t, n]], {n, 1000}]; t (* _Zak Seidov_, Jan 25 2013 *)

%o (PARI) d(n) = prime(n+1)-prime(n); e(n) = d(n)+d(n+1)+d(n+2); j=[]; for(n=1,35000, if(e(n)==8,j=concat(j,n))); j

%o (PARI) d3(n)= { prime(n + 3) - prime(n) } { n=0; default(primelimit, 12000000); for (m=1, 10^9, if (d3(m)==8, write("b064026.txt", n++, " ", m); if (n==1000, break)) ) } [_Harry J. Smith_, Sep 06 2009]

%K easy,nonn

%O 1,1

%A _Jason Earls_, Sep 08 2001

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 March 19 04:58 EDT 2024. Contains 370952 sequences. (Running on oeis4.)