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 Jun 06 2024 23:23:57
%S 0,1,2,3,9,11,19,27,31,36,42,69,86,98,152,205,533,587,1302,1506,1521,
%T 1573,1807,3906,6461,9081,11766,12595,15697,17154,30507,36074,52667,
%U 61367,122377,169759
%N Numbers k such that 4*10^k + 19 is prime.
%C For k > 1, numbers k such that the digit 4 followed by k-2 occurrences of the digit 0 followed by the digits 19 is prime (see Example section).
%C a(37) > 3*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 40w19</a>.
%e 3 is in this sequence because 4*10^3 + 19 = 4019 is prime.
%e Initial terms and associated primes:
%e a(1) = 0, 23;
%e a(2) = 1, 59;
%e a(3) = 2, 419;
%e a(4) = 3, 4019;
%e a(5) = 9, 4000000019, etc.
%t Select[Range[0, 100000], PrimeQ[4*10^# + 19] &]
%o (PARI) is(n)=ispseudoprime(4*10^n + 19) \\ _Charles R Greathouse IV_, Jun 13 2017
%Y Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269.
%K nonn,more
%O 1,3
%A _Robert Price_, Apr 09 2016
%E a(35)-a(36) from _Robert Price_, Oct 22 2018