|
|
A166237
|
|
Differences between consecutive products of two distinct primes: a(n) = A006881(n+1) - A006881(n).
|
|
12
|
|
|
4, 4, 1, 6, 1, 4, 7, 1, 1, 3, 1, 7, 5, 4, 2, 1, 4, 3, 4, 5, 3, 5, 3, 1, 1, 4, 2, 1, 1, 11, 5, 4, 3, 1, 3, 1, 6, 4, 1, 7, 1, 1, 2, 1, 9, 3, 1, 2, 5, 11, 1, 5, 2, 2, 7, 7, 1, 1, 2, 1, 3, 4, 1, 1, 2, 1, 1, 2, 5, 9, 2, 10, 2, 4, 1, 5, 3, 3, 2, 7, 4, 9, 4, 4, 3, 1, 2, 1, 1, 2, 4, 5, 5, 2, 2, 3, 1, 2, 5, 1, 4, 2, 5, 9, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Goldston, Graham, Pintz & Yıldırım (2005) prove that a(n+1) - a(n) <= 26 infinitely often. They improve this constant to 6 in their 2009 paper. - Charles R Greathouse IV, Dec 26 2020
|
|
LINKS
|
D. A. Goldston, S. W. Graham, J. Pintz and C. Y. Yıldırım, Small gaps between primes and almost primes, arXiv:math/0506067 [math.NT], 2005; Proceedings of the London Mathematical Society 98:3 (May 2009), pp. 741-774.
|
|
MATHEMATICA
|
f[n_]:=Last/@FactorInteger[n]=={1, 1}; a=6; lst={}; Do[If[f[n], AppendTo[lst, n-a]; a=n], {n, 9, 6!}]; lst
|
|
PROG
|
(PARI) {m=106; v=vector(m); n=0; c=0; while(c<m, n++; if(bigomega(n)==2&&omega(n)==2, c++; v[c]=n)); w=vector(m-1, j, v[j+1]-v[j])} \\ Klaus Brockhaus, Oct 13 2009
(Magma) T:=[ n: n in [1..360] | #PrimeDivisors(n) eq 2 and &*[ d[2]: d in Factorization(n) ] eq 1 ]; [ T[j+1]-T[j]: j in [1..#T-1] ]; // Klaus Brockhaus, Oct 13 2009
|
|
CROSSREFS
|
Cf. A006881 (products of two distinct primes), A001358 (semiprimes: products of two primes), A065516 (differences between products of two primes), A001223 (differences between consecutive primes).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|