The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A274242 Numbers whose factorization contains only the greater members of twin prime pairs. 1
 1, 5, 7, 13, 19, 25, 31, 35, 43, 49, 61, 65, 73, 91, 95, 103, 109, 125, 133, 139, 151, 155, 169, 175, 181, 193, 199, 215, 217, 229, 241, 245, 247, 271, 283, 301, 305, 313, 325, 343, 349, 361, 365, 403, 421, 427, 433, 455, 463, 475, 511, 515, 523, 545, 559, 571, 589, 601, 619, 625, 637, 643, 661, 665, 695, 721, 755, 763, 775, 793, 811, 817, 823, 829, 845, 859, 875, 883, 905, 931 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 1 is in the sequence by convention. LINKS Robert Israel, Table of n, a(n) for n = 1..10000 Benoit Cloitre, Plot of a(n)/A274212(n) FORMULA Arithmetic conjecture: the equation a(n+1) - a(n) = 2r has infinitely many solutions for any fixed integer value r >= 1. Analytic conjecture: a(n) is asymptotic to D*n*log(n)^2 for a constant D > 0.4 hence lim_{n->oo} a(n)/A274212(n) exists (see link). EXAMPLE 65 = 5*13 is a term because there are twin prime pairs (3,5) and (11,13). MAPLE N:= 10^4: # to get all terms <= N Primes:= select(isprime, {seq(i, i=3..N, 2)}): Twins:= Primes intersect map(`+`, Primes, 2): S:= {1}: for p in Twins do S:= map(s -> seq(s*p^i, i=0..ilog[p](floor(N/s))), S) od: sort(convert(S, list)); # Robert Israel, Jun 15 2016 MATHEMATICA Join[{1}, Select[Range[1, 1000, 2], AllTrue[FactorInteger[#][[All, 1]], PrimeQ[# - 2]& ]& ] ] (* Jean-François Alcover, Jun 16 2016 *) PROG (PARI) for(n=1, 1000, if(prod(i=1, omega(n), isprime(factor(n)[i, 1]-2))==1, print1(n, ", "))) CROSSREFS Cf. A006512, A274212. Sequence in context: A314326 A314327 A215804 * A163427 A215805 A339692 Adjacent sequences: A274239 A274240 A274241 * A274243 A274244 A274245 KEYWORD nonn AUTHOR Benoit Cloitre, Jun 15 2016 STATUS approved

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.

Last modified August 5 18:51 EDT 2024. Contains 374954 sequences. (Running on oeis4.)