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!)
A062505 Numbers k such that if p is a prime that divides k, then either p + 2 or p - 2 is also prime. 3

%I #21 Sep 08 2022 08:45:03

%S 1,3,5,7,9,11,13,15,17,19,21,25,27,29,31,33,35,39,41,43,45,49,51,55,

%T 57,59,61,63,65,71,73,75,77,81,85,87,91,93,95,99,101,103,105,107,109,

%U 117,119,121,123,125,129,133,135,137,139,143,145,147,149,151,153,155,165

%N Numbers k such that if p is a prime that divides k, then either p + 2 or p - 2 is also prime.

%C Multiplicative closure of twin primes (A001097).

%D Stephan Ramon Garcia and Steven J. Miller, 100 Years of Math Milestones: The Pi Mu Epsilon Centennial Collection, American Mathematical Society, 2019, pp. 35-37.

%H Amiram Eldar, <a href="/A062505/b062505.txt">Table of n, a(n) for n = 1..10000</a>

%e 35 is included because 35 = 5*7 and both (5+2) and (7-2) are primes.

%e 65 = 5*13 where the factors are members of twin prime pairs: (3,5) and (11,13), therefore a(29) = 65 is a term; but 69 is not because 69 = 3*23 and 23 = A007510(2) is a single prime.

%t nmax = 15 (* corresponding to last twin prime pair (197,199) *); tp[1] = 3; tp[n_] := tp[n] = (p = NextPrime[tp[n-1]]; While[ !PrimeQ[p+2], p = NextPrime[p]]; p); twins = Flatten[ Table[ {tp[n], tp[n]+2}, {n, 1, nmax}]]; max = Last[twins]; mult[twins_] := Select[ Union[ twins, Apply[ Times, Tuples[twins, {2}], {1}]], # <= max & ]; A062505 = Join[{1}, FixedPoint[mult, twins] ] (* _Jean-François Alcover_, Feb 23 2012 *)

%o (Magma) [k:k in [1..170] | forall{p:p in PrimeDivisors(k)| IsPrime(p+2) or IsPrime(p-2)}]; // _Marius A. Burtea_, Dec 30 2019

%Y Range of A072963.

%Y Cf. A001097, A074480.

%K nonn

%O 1,2

%A _Leroy Quet_, Jul 09 2001

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 April 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)