login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007530 Prime quadruples: numbers n such that n, n+2, n+6, n+8 are all prime.
(Formerly M3816)
64
5, 11, 101, 191, 821, 1481, 1871, 2081, 3251, 3461, 5651, 9431, 13001, 15641, 15731, 16061, 18041, 18911, 19421, 21011, 22271, 25301, 31721, 34841, 43781, 51341, 55331, 62981, 67211, 69491, 72221, 77261, 79691, 81041, 82721, 88811, 97841, 99131 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Except for the first term, 5, all terms == 11 (mod 30). - Zak Seidov, Dec 04 2008

Some further values: For k = 1, ..., 10, a(k*10^3) = 11721791, 31210841, 54112601, 78984791, 106583831, 136466501, 165939791, 196512551, 230794301, 265201421. - M. F. Hasler, May 04 2009

n is the first prime of 2 consecutive twin prime pairs. - Daniel Forgues, Aug 01 2009

The prime quadruples of form p + (0, 2, 6, 8) have the quadruple congruence class (-1, +1, -1, +1) (mod 6). - Daniel Forgues, Aug 12 2009

s = (p+8)-(p) = 8 is the smallest s giving an admissible prime quadruple form, for which the only admissible form is p + (0, 2, 6, 8), since (0, 2, 6, 8) is the only form not covering all the congruence classes for any prime <= 4. Since s is smallest, these prime quadruples are prime constellations (or prime quadruplets), i.e., they contain consecutive primes. - Daniel Forgues, Aug 12 2009

Except for the first term, 5, all prime quadruples are of the form (15k-4, 15k-2, 15k+2, 15k+4), with k >= 1, and so are centered on 15k. - Daniel Forgues, Aug 12 2009

Solutions of the equation n'+(n+2)'+(n+6)'+(n+8)'=4, where n' is the arithmetic derivative of n'. - Paolo P. Lava, Nov 09 2012

Subsequence of A022004. - R. J. Mathar, Feb 10 2013

The quadruplets are listed in A136162. - M. F. Hasler, Apr 20 2013

REFERENCES

H. Rademacher, Lectures on Elementary Number Theory. Blaisdell, NY, 1964, p. 4.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

C. K. Caldwell, The Prime Glossary, prime quadruple

T. R. Nicely, Enumeration to 1.6e15 of the prime quadruplets

H. Riesel, Prime numbers and computer methods for factorization, Progress in Mathematics, Vol. 57, Birkhäuser, Boston, 1985, ISBN: 978-0-8176-8297-2, Chap. 4, see p. 65.

Eric Weisstein's World of Mathematics, Prime Quadruplet

FORMULA

a(n) = 11 + 30*A014561(n-1) for n>1. - M. F. Hasler, May 04 2009

EXAMPLE

Contribution from M. F. Hasler, May 04 2009: (Start)

a(1)=5 is the start of the first prime quadruplet, {5,7,11,13}.

a(2)=11 is the start of the second prime quadruplet, {11,13,17,19}, and all other prime quadruplets differ from this one by a multiple of 30.

a(100)=470081 is the start of the 100th prime quadruplet;

a(500)=4370081 is the start of the 500th prime quadruplet.

a(167)=1002341 is the least quadruplet prime beyond 10^6. (End)

MAPLE

A007530:=proc(q)

local n;

for n from 1 to q do

   if isprime(n) and isprime (n+2) and isprime(n+6) and isprime (n+8) then print(n); fi;

od; end:

A007530(10000000000);  # Paolo P. Lava, Jan 30 2013.

MATHEMATICA

A007530 = Select[Range[1, 10^5 - 1, 2], Union[PrimeQ[# + {0, 2, 6, 8}]] == {True} &] (* Alonso del Arte, Sep 24 2011 *)

PROG

(PARI) A007530( n, print_all=0, s=2 )={ my(p, q, r); until(!n--, until( p+8==s=nextprime(s+2), p=q; q=r; r=s); print_all && print1(p", ")); p} \\ The optional 3rd argument can be used to obtain large values by starting from some precomputed point instead of zero, using a(n+k) = A007530(k+1, , a(n)) (or A007530(k, , a(n)-1) for k>0); e.g., you get a(10^4+k) using A007530(k+1, , 265201421) (value of a(10^4) from the comments section). - M. F. Hasler, May 04 2009

(MAGMA) [ p: p in PrimesUpTo(11000)| IsPrime(p+2) and IsPrime(p+6) and IsPrime(p+8)] // Vincenzo Librandi, Nov 18 2010

(PARI) forprime(p=2, 10^5, if(isprime(p+2) && isprime(p+6) && isprime(p+8), print1(p, ", "))) \\ Felix Fröhlich, Jun 22 2014

CROSSREFS

Cf. A159910 (first differences divided by 30), A120120.

Cf. A007811, A014561.

Sequence in context: A199325 A199305 A096473 * A157967 A088268 A030085

Adjacent sequences:  A007527 A007528 A007529 * A007531 A007532 A007533

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Robert G. Wilson v

EXTENSIONS

More terms from Warut Roonguthai

Incorrect formula and Mathematica program removed by N. J. A. Sloane, Dec 04 2008, at the suggestion of Zak Seidov

Values up to a(1000) checked with the given PARI code by M. F. Hasler, May 04 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 17 22:43 EST 2014. Contains 252040 sequences.