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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190792 Primes p=prime(i) such that prime(i+3)-prime(i)=12. 3
17, 19, 29, 31, 41, 59, 61, 67, 71, 127, 227, 229, 269, 271, 347, 431, 607, 641, 1009, 1091, 1277, 1279, 1289, 1291, 1427, 1447, 1487, 1597, 1601, 1607, 1609, 1657, 1777, 1861, 1987, 2129, 2131, 2339, 2371, 2377, 2381, 2539, 2677, 2687, 2707, 2789, 2791 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Minimal distance between prime(i) and prime(i+3) is 12 if all three consecutive prime gaps are different.

There are 6 possible consecutive prime gap configurations:

{2,4,6}, {2,6,4}, {4,2,6}, {4,6,2}, {6,2,4}, and {6,4,2}.

Least prime quartets with such gap configurations are:

{17,19,23,29}->{2,4,6}

{29,31,37,41}->{2,6,4}

{67,71,73,79}->{4,2,6}

{19,23,29,31}->{4,6,2}

{1601,1607,1609,1613}->{6,2,4}

{31,37,41,43}->{6,4,2}.

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

MATHEMATICA

p = Prime[Range[1000]]; First /@ Select[Partition[p, 4, 1], Last[#] - First[#] == 12 &] (* T. D. Noe, May 23 2011 *)

PROG

(MAGMA) [NthPrime(i): i in [2..60000] | NthPrime(i+3)-NthPrime(i) eq 12];  // Bruno Berselli, May 20 2011

(PARI) is(n)=if(!isprime(n), return(0)); my(p=nextprime(n+1), q); if(p-n>6, return(0)); q=nextprime(p+1); q-n<11 && nextprime(q+1)-n==12 \\ Charles R Greathouse IV, Sep 14 2015

CROSSREFS

Cf. A078847.

Sequence in context: A053689 A176462 A060254 * A137796 A125213 A132246

Adjacent sequences:  A190789 A190790 A190791 * A190793 A190794 A190795

KEYWORD

nonn,easy

AUTHOR

Zak Seidov, May 20 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 7 15:48 EDT 2020. Contains 335495 sequences. (Running on oeis4.)