OFFSET
1,2
COMMENTS
1 is in the sequence by convention.
The longest chain of consecutive odd numbers in this sequence has length 6 (otherwise one of the terms is divisible by 7). - Zak Seidov, Jun 20 2016
The first occurrence of five consecutive odd numbers is a(1473448)..a(1473452) = {80008203 = 3 * 11 * 2424491, 80008205 = 5 * 17^3 * 3257, 80008207 = 2081 * 38447, 80008209 = 3^3 * 2963267, 80008211}. - Charles R Greathouse IV, Jun 30 2016
Smallest n (if any) such that n+{0,2,4,6,8,10} all are terms is n > 10^12 according to Giovanni Resta. - Zak Seidov, Jul 01 2016
For any two terms, the sequence also contains their product. Reciprocally, this allows us to generate the whole sequence which is the closure, with respect to multiplication, of the set A001359 of lesser of twin primes. - M. F. Hasler, Jun 23 2016
LINKS
Zak Seidov, Table of n, a(n) for n = 1..15000
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 C*n*log(n)^2 for a constant C > 0.2.
PROG
(PARI) for(n=1, 1000, if(prod(i=1, omega(n), isprime(factor(n)[i, 1]+2))==1, print1(n, ", ")))
(PARI) is(n)=!for(i=1, #n=factor(n)~, isprime(n[1, i]+2)||return) \\ prefix "bittest(n, 0) &&" for efficiency, if the selection is to be applied to numbers of unknown parity. - M. F. Hasler, Jun 23 2016
(PARI) list(lim, mx=lim)=my(u, v=List([1]), P=List(), p=2); forprime(q=3, min(mx, lim)+2, if(q-p==2, listput(P, p)); p=q); for(i=1, #P, p=P[i]; if(3*p>lim, for(j=i, #P, listput(v, P[j])); break); u=list(lim\p, p); for(j=1, #u, listput(v, p*u[j]))); Set(v) \\ Charles R Greathouse IV, Jun 30 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jun 13 2016
STATUS
approved