|
%I #12 Mar 21 2020 17:57:17
%S 2,3,4,10,35,60,65,72,87,218,226,326,365,461,611,1244,1566,4839,4913,
%T 5396,7020,8410,9714,10362,11405,21695,25240,56076,56588,74579,81990,
%U 114736
%N Numbers k such that (265*10^k + 17)/3 is prime.
%C For k>1, numbers k such that the digits 88 followed by k-1 occurrences of the digit 3 followed by the digit 9 is prime (see Example section).
%C a(33) > 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/primedifficulty.txt">Search for 883w9</a>.
%e 3 is in this sequence because (265*10^3 + 17)/3 = 88339 is prime.
%e Initial terms and primes associated:
%e a(1) = 2, 8839;
%e a(2) = 3, 88339;
%e a(3) = 4, 883339;
%e a(4) = 10, 883333333339;
%e a(5) = 35, 8833333333333333333333333333333333339, etc.
%t Select[Range[0, 100000], PrimeQ[(265*10^# + 17)/3] &]
%o (PARI) is(n)=ispseudoprime((265*10^n + 17)/3) \\ _Charles R Greathouse IV_, Jun 13 2017
%Y Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269.
%K nonn,more
%O 1,1
%A _Robert Price_, May 01 2016
%E a(32) from _Robert Price_, Mar 21 2020
|
