cp's OEIS Frontend

A007529 Prime triples: p; p+2 or p+4; p+6 all prime.

%I A007529 M3760 #40 Apr 07 2022 10:44:53
%S A007529 5,7,11,13,17,37,41,67,97,101,103,107,191,193,223,227,277,307,311,347,
%T A007529 457,461,613,641,821,823,853,857,877,881,1087,1091,1277,1297,1301,
%U A007529 1423,1427,1447,1481,1483,1487,1607,1663,1693,1783,1867,1871,1873,1993,1997
%N A007529 Prime triples: p; p+2 or p+4; p+6 all prime.
%C A007529 Or, prime(m) such that prime(m+2) = prime(m)+6. - _Zak Seidov_, May 07 2012
%D A007529 H. Riesel, "Prime numbers and computer methods for factorization", Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see p. 65.
%D A007529 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007529 Zak Seidov, <a href="/A007529/b007529.txt">Table of n, a(n) for n = 1..10000</a>
%H A007529 Ernest G. Hibbs, <a href="https://www.proquest.com/openview/4012f0286b785cd732c78eb0fc6fce80">Component Interactions of the Prime Numbers</a>, Ph. D. Thesis, Capitol Technology Univ. (2022), see p. 33.
%F A007529 a(n) = A098415(n) - 6. - _Zak Seidov_, Apr 30 2015
%p A007529 N:= 10000: # to get all terms <= N
%p A007529 Primes:= select(isprime, [seq(2*i+1, i=1..floor((N+5)/2))]):locs:= select(t -> Primes[t+2]-Primes[t]=6, [$1..nops(Primes)-2]):
%p A007529 Primes[locs]; # _Robert Israel_, Apr 30 2015
%t A007529 ptrsQ[n_]:=PrimeQ[n+6]&&(PrimeQ[n+2]||PrimeQ[n+4])
%t A007529 Select[Prime[Range[400]],ptrsQ]  (* _Harvey P. Dale_, Mar 08 2011 *)
%o A007529 (Magma) [NthPrime(n): n in [1..310] | (NthPrime(n)+6) eq NthPrime(n+2)]; // _Bruno Berselli_, May 07 2012
%o A007529 (PARI) p=2;q=3;forprime(r=5,1e4,if(r-p==6,print1(p", "));p=q;q=r) \\ _Charles R Greathouse IV_, May 07 2012
%Y A007529 Cf. A031924, A023201, A098414, A098415, A098424, A098416, A098417.
%Y A007529 Union of A022004 and A022005.
%K A007529 nonn
%O A007529 1,1
%A A007529 _N. J. A. Sloane_, _Robert G. Wilson v_