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 #17 May 27 2024 07:16:56
%S 1,2,4,7,8,26,64,116,123,157,178,288,328,1730,2712,3244,3865,7766,
%T 8792,9512,14917,33912,39058,57997,120306,150675,171306,173467,175965
%N Numbers k such that (13*10^k - 37)/3 is prime.
%C For k > 1, numbers k such that the digit 4 followed by k-2 occurrences of the digit 3 followed by the digits 21 is prime (see Example section).
%C a(30) > 2*10^5.
%H Makoto Kamada, <a href="https://stdkmd.net/nrr">Factorization of near-repdigit-related numbers</a>.
%H Makoto Kamada, <a href="https://stdkmd.net/nrr/prime/prime_difficulty.txt">Search for 43w21</a>.
%e 4 is in this sequence because (13*10^4 - 37)/3 = 43321 is prime.
%e Initial terms and associated primes:
%e a(1) = 1, 31;
%e a(2) = 2, 421;
%e a(3) = 4, 43321;
%e a(4) = 7, 43333321;
%e a(5) = 8, 433333321; etc.
%t Select[Range[2, 100000], PrimeQ[(13*10^# - 37)/3] &]
%o (PARI) isok(n) = isprime((13*10^n - 37)/3); \\ _Altug Alkan_, Aug 21 2017
%Y Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269.
%K nonn,more,hard
%O 1,2
%A _Robert Price_, Aug 19 2017
%E a(25)-a(29) from _Robert Price_, Jan 01 2019