OFFSET
1,1
COMMENTS
Differences of the products of alternate primes.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
FORMULA
a(n) >> n log n and this is probably sharp: on Dickson's conjecture there are infinitely many a(n) < kn log n for any k > 4. The constant 4 comes from 8 + 2 - 6 - 0 n the prime quadruplet (p+0, p+2, p+6, p+8). On Cramér's conjecture a(n) = O(n log^3 n). Unconditionally a(n) << n^1.525 log n. - Charles R Greathouse IV, Jun 10 2013
MATHEMATICA
#[[2]]#[[4]]-#[[1]]#[[3]]&/@Partition[Prime[Range[60]], 4, 1] (* Harvey P. Dale, Jul 14 2025 *)
PROG
(PARI) p=2; q=3; r=5; forprime(s=7, 1e2, print1(q*s-p*r", "); p=q; q=r; r=s) \\ Charles R Greathouse IV, Jun 10 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ed Smiley, Jun 09 2013
STATUS
approved
