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 #24 Jun 06 2024 23:23:53
%S 1,2,5,6,13,37,50,55,71,89,217,352,355,398,449,668,742,870,1360,1579,
%T 2848,3774,5039,5051,6134,6824,7255,12586,17106,27502,30581,33817,
%U 97399,170800,172219,177872
%N Numbers k such that 3*10^k + 73 is prime.
%C For k > 1, numbers k such that the digit 3 followed by k-2 occurrences of the digit 0 followed by the digits 73 is prime (see Example section).
%C a(37) > 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 30w73</a>.
%e 5 is in this sequence because 3*10^5 + 73 = 300073 is prime.
%e Initial terms and associated primes:
%e a(1) = 1, 103;
%e a(2) = 2, 373;
%e a(3) = 5, 300073;
%e a(4) = 6, 3000073;
%e a(5) = 13, 30000000000073, etc.
%t Select[Range[0, 100000], PrimeQ[3*10^# + 73] &]
%o (PARI) is(n)=ispseudoprime(3*10^n + 73) \\ _Charles R Greathouse IV_, Jun 13 2017
%Y Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269.
%K nonn,more
%O 1,2
%A _Robert Price_, Apr 11 2016
%E a(34)-a(36) from _Robert Price_, Aug 10 2018