OFFSET
1,1
COMMENTS
All terms are congruent to 11 (modulo 210). - Matt C. Anderson, May 26 2015
REFERENCES
Martin Gardner, The Last Recreations, Chapter 12: Strong Laws of Small Primes, Springer-Verlag, 1997, pp. 191-205, especially p. 197.
Martin Gardner, Patterns in primes are a clue to the strong law of small numbers, Mathematical Games column, Scientific American, (December, 1980), pp. 20ff.
LINKS
Dana Jacobsen, Table of n, a(n) for n = 1..10000 (first 1000 terms from Matt C. Anderson)
T. Forbes and Norman Luhn, Prime k-tuplets
Stephan Ramon Garcia, Jeffrey Lagarias, and Ethan Simpson Lee, The error term in the truncated Perron formula for the logarithm of an L-function, arXiv:2206.01391 [math.NT], 2022.
Norman Luhn and Hugo Pfoertner, 10 million terms of A022011, 7z compressed (47.7 MB) (2021).
MATHEMATICA
Select[Prime[Range[2 10^9]], Union[PrimeQ[# + {2, 6, 8, 12, 18, 20, 26}]] == {True} &] (* Vincenzo Librandi, Oct 01 2015 *)
PROG
(Perl) use ntheory ":all"; say for sieve_prime_cluster(1, 1e10, 2, 6, 8, 12, 18, 20, 26); # Dana Jacobsen, Sep 30 2015
(Magma) [p: p in PrimesUpTo(4*10^8) | forall{p+r: r in [2, 6, 8, 12, 18, 20, 26] | IsPrime(p+r)}]; // Vincenzo Librandi, Oct 01 2015
(PARI) forprime(p=2, 10^30, if (isprime(p+2) && isprime(p+6) && isprime(p+8) && isprime(p+12) && isprime(p+18) && isprime(p+20) && isprime(p+26), print1(p", "))) \\ Altug Alkan, Oct 01 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Reference provided by Harvey P. Dale, May 10 2013
More terms from Matt C. Anderson, Dec 06 2013
STATUS
approved