login

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”).

A280449
Numbers k such that (2*10^k - 71)/3 is prime.
0
2, 3, 5, 6, 8, 11, 15, 25, 38, 54, 101, 105, 158, 295, 303, 389, 482, 558, 693, 1965, 3503, 9818, 13255, 30351, 51285, 54767, 57384, 88808, 109645, 174301, 187062
OFFSET
1,1
COMMENTS
For k > 1, numbers k such that the number consisting of k-2 occurrences of the digit 6 followed by the digits 43 is prime (see Example section).
a(32) > 2*10^5.
EXAMPLE
5 is in this sequence because (2*10^5 - 71) / 3 = 66643 is prime.
Initial terms and associated primes:
a(1) = 2, 43;
a(2) = 3, 643;
a(3) = 5, 66643;
a(4) = 6, 666643;
a(5) = 8, 66666643; etc.
MATHEMATICA
Select[Range[2, 100000], PrimeQ[(2*10^# - 71) / 3] &]
PROG
(PARI) is(n)=isprime((2*10^n - 71)/3) \\ Charles R Greathouse IV, Jan 03 2017
KEYWORD
nonn,more,hard
AUTHOR
Robert Price, Jan 03 2017
EXTENSIONS
a(29) - a(31) from Robert Price, Dec 31 2017
STATUS
approved