cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A128038 Primes p such that p1=2p-33 and p2=2p+33 are consecutive primes.

This page as a plain text file.
%I A128038 #10 Feb 12 2019 00:40:17
%S A128038 129533,141263,212873,323243,381077,393697,449677,486377,525607,
%T A128038 583753,693733,774343,988733,1115453,1138987,1200887,1204823,1394083,
%U A128038 1419163,1604143,1661237,1688887,1760797,1823567,1825687,1880363,1972037
%N A128038 Primes p such that p1=2p-33 and p2=2p+33 are consecutive primes.
%e A128038 {p,p1,p2,pi(p1),pi(p2)}:{129533,259033,259099,22765,22766},{141263,282493,282559,24644,24645},{212873,425713,425779,35832,35833},{323243,646453,646519,52557,52558},{381077,762121,762187,61145,61146},{393697,787361,787427,63011,63012}.
%p A128038 a:=proc(n) if isprime(n)=true and isprime(2*n-33)=true and nextprime(2*n-33)=2*n+33 then n else fi end: seq(a(n),n=1..3000000); # _Emeric Deutsch_, May 09 2007
%t A128038 cp66Q[n_]:=Module[{p1=2n-33},PrimeQ[p1]&&NextPrime[p1]-p1==66]; Select[Prime[Range[150000]],cp66Q]  (* _Harvey P. Dale_, Mar 24 2011 *)
%Y A128038 Cf. A103806.
%K A128038 nonn
%O A128038 1,1
%A A128038 _Zak Seidov_, May 07 2007
%E A128038 More terms from _Emeric Deutsch_, May 09 2007