OFFSET
1,1
COMMENTS
For k > 1, numbers k such that k-2 occurrences of the digit 3 followed by the digits 29 is prime (see Example section).
a(27) > 2 * 10^5.
There are no odd multiples of 3 in this sequence. If k is an odd multiple of 3, then (10^k - 13)/3 is divisible by 7. The smallest even multiple of 3 in the sequence is 270. - Alonso del Arte, Dec 31 2017
LINKS
Makoto Kamada, Factorization of near-repdigit-related numbers.
Makoto Kamada, Search for 3w29.
EXAMPLE
4 is in this sequence because (10^4 - 13)/3 = 3329 is prime.
Here is a listing of the initial terms and associated primes:
a(1) = 2, 29;
a(2) = 4, 3329;
a(3) = 5, 33329;
a(4) = 8, 33333329;
a(5) = 11, 33333333329; etc.
MATHEMATICA
Select[Range[2, 100000], PrimeQ[(10^# - 13)/3] &]
PROG
(PARI) isok(n) = isprime((10^n-13)/3); \\ Altug Alkan, Dec 31 2017
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
Robert Price, Feb 21 2017
EXTENSIONS
a(26) from Robert Price, Dec 31 2017
STATUS
approved