Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Jul 21 2021 09:48:19
%S 6,87,0,0,6057,0,91257,526557,12710877,2054787,10234947,6222567,
%T 33407547,6589467,44514957,587445747,113139567,816858057,210160347,
%U 896654097,1523730387,1048338207,1309977027,2095519077,3453564567,1143089517,735261237,723151317,99411447,77882127
%N 10^n + a(n) is the smallest (n+1)-digit initial member of a prime sextuplet, or a(n) = 0 if no such number exists.
%C The smallest (n+1)-digit sextuplet is given as 10^n + a(n) + {0, 4, 6, 10, 12, 16}.
%C a(0) = 6 and a(1) = 87, i.e., n = 0 and n = 1, are the only cases where larger members of the sextuplet have one digit more than the smallest member of the sextuplet. These terms would be zero if all members of the sextuplet ought to have the same number of digits. We require only the first member to have the given number of digits, in order to include these two nontrivial terms.
%C Numerical evidence strongly suggests the conjecture that 0 < a(n) < 10^n for all n > 5, but not even the existence of infinitely many prime sextuplets is proved.
%C Values for n > 300 found by _Norman Luhn_: a(399) = 33756090918084087, a(499) = 464261549124325347 (October 2020), a(599) = 314360191056418137 (June 2021).
%H M. F. Hasler, <a href="/A343636/b343636.txt">Table of n, a(n) for n = 0..299</a>
%H Norman Luhn, <a href="https://mathematikalpha.de/primzahltupel">Primzahltupel, prime k-tuple: Smallest-n-digit-prime-sexuplets</a>, on mathematikalpha.de, 2020
%e a(0) = 6 because A022008(1) = 7 = 10^0 + 6 is the start of the smallest prime sextuplet, starting with a 1-digit prime.
%e a(1) = 87 because A022008(2) = 97 = 10^1 + 87 is the start of the smallest prime sextuplet starting with a 2-digit prime.
%e a(n) = 0 iff n = 2, 3 or 5, because there is no prime sextuplet with members having 3, 4 or 6 digits.
%e a(4) = 6057 because A022008(3) = 16057 = 10^4 + 6057 is the start of the smallest prime sextuplet made of 5-digit primes.
%o (PARI) apply( {A343636(n,D=[16,12,10,6,4])=forprime(p=10^n, 10^(n+1), foreach(D, d, ispseudoprime(p+d)||next(2));return(p-10^n))}, [0..11]) \\ For illustration; unoptimized code, very fast only for n < 12.
%Y Cf. A022008 (start of prime sextuplets).
%K nonn,base,hard
%O 0,1
%A _M. F. Hasler_, Jul 13 2021