The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A177032 Primes p of a quadruplet (p,p+2,p+6,p+8) such that (p+(p+2)+(p+6)+(p+8))/60 is a prime. 1

%I #14 Sep 26 2018 02:53:49

%S 101,191,2081,15731,67211,122201,165701,171161,195731,257861,268811,

%T 388691,394811,420851,452531,500231,563411,572651,607301,632081,

%U 907391,983441,1093061,1117601,1117811,1155611,1156031,1402361,1685441,1917731

%N Primes p of a quadruplet (p,p+2,p+6,p+8) such that (p+(p+2)+(p+6)+(p+8))/60 is a prime.

%C As noted in A007530, p is of the form p = 6*k-1, so p+2 = 6*k+1, p+6 = 6*k+5, p+8 = 6*k+7. The sum is therefore s = p+(p+2)+(p+6)+(p+8) = 12*(2*k+1). From the same mod 30 formula in A007530, p is also of the form p = 10*m+1, so the sum of the primes in the quadruplet is also of the form s = 5*(8*m+4). Watching the factors of 12 and 5 in these two factorizations of the sum, the factor 60 (least common multiple) is in some sense the optimum, and this is the rationale to look for primes that are a 60th of the sum.

%C The primes that are generated by a 60th of the sum are: 7, 13, 139, 1049, 4481, 8147, 11047, 11411, 13049, 17191,...

%C The indices of the p in the sequence of quadruplets (A007530) are 3, 4, 8, 15, 29, 43, 47, 49, 52, 61, 64, 82, 85, 92, 96, 104, 112,...

%D A. Bartholome, J. Rung, H. Kern: Zahlentheorie für Einsteiger, vieweg Verlag, 5. Auflage, Wiesbaden, 2006

%D F. Ischebeck: Einladung zur Zahlentheorie, B.I. Wissenschaftsverlag, Mannheim-Leipzig-Wien-Zürich, 1992

%D H. Tietze: Gelöste und ungelöste mathematische Probleme aus alter und neuer Zeit, Band 1, dtv Wissenschaft, Muenchen, 1984

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

%e p=11, 11+13+17+19 = 1*60, 1 is not prime, 11 is not a term of the sequence.

%e p=101: 101+103+107+109 = 7*60, 7 = prime(4), 101 = prime(26) is a term.

%e p=191: 191+193+197+199 = 13*60, 13 = prime(6), 191 = prime(43) is a term.

%t Reap[For[n = 1, n < 150000, n++, p = Prime[n]; If[PrimeQ[p + 2] && PrimeQ[p + 6] && PrimeQ[p + 8] && PrimeQ[(p + 4)/15], Sow[p]]]][[2, 1]](* _Jean-François Alcover_, May 07 2012 *)

%t Select[Partition[Prime[Range[150000]],4,1],Differences[#]=={2,4,2}&&PrimeQ[ Total[#]/60]&][[All,1]] (* _Harvey P. Dale_, Apr 09 2018 *)

%Y Cf. A000040, A001359, A007530.

%K nonn

%O 1,1

%A Ulrich Krug (leuchtfeuer37(AT)gmx.de), May 01 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 May 20 06:19 EDT 2024. Contains 372703 sequences. (Running on oeis4.)