# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a282505
Showing 1-1 of 1

%I A282505 #14 May 25 2024 14:28:39
%S A282505 1,2,3,4,5,6,12,32,63,116,154,221,267,468,605,749,1911,7241,7406,7797,
%T A282505 9428,11094,43917,44127,58384,131223,181127
%N A282505 Numbers k such that (5*10^k - 29)/3 is prime.
%C A282505 For k > 1, numbers k such that the digit 1 followed by k-2 occurrences of the digit 6 followed by the digits 57 is prime (see Example section).
%C A282505 a(28) > 2*10^5.
%H A282505 Makoto Kamada, <a href="https://stdkmd.net/nrr">Factorization of near-repdigit-related numbers</a>.
%H A282505 Makoto Kamada, <a href="https://stdkmd.net/nrr/prime/prime_difficulty.txt">Search for 16w57</a>.
%e A282505 3 is in this sequence because (5*10^3 - 29)/3 = 1657 is prime.
%e A282505 Initial terms and associated primes:
%e A282505 a(1) = 1, 7;
%e A282505 a(2) = 2, 157;
%e A282505 a(3) = 3, 1657;
%e A282505 a(4) = 4, 16657;
%e A282505 a(5) = 5, 166657; etc.
%t A282505 Select[Range[1, 100000], PrimeQ[(5*10^# - 29)/3] &]
%o A282505 (PARI) isok(k) = isprime((5*10^k - 29)/3); \\ _Michel Marcus_, Mar 06 2018
%Y A282505 Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269.
%K A282505 nonn,more,hard
%O A282505 1,2
%A A282505 _Robert Price_, Feb 16 2017
%E A282505 a(26)-a(27) from _Robert Price_, Mar 05 2018

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE