cp's OEIS Frontend

A271822 Numbers k such that (91*10^k + 11)/3 is prime.

%I A271822 #27 May 26 2024 16:02:18
%S A271822 1,2,4,6,12,13,14,17,19,31,50,58,81,87,161,234,244,482,505,676,1111,
%T A271822 1707,1929,2695,3819,7708,28958,44652,51508,56892,158862,160249,162410
%N A271822 Numbers k such that (91*10^k + 11)/3 is prime.
%C A271822 Numbers k such that the digits 30 followed by k-1 occurrences of the digit 3 followed by the digit 7 is prime (see Example section).
%C A271822 a(34) > 3*10^5.
%H A271822 Makoto Kamada, <a href="https://stdkmd.net/nrr">Factorization of near-repdigit-related numbers</a>.
%H A271822 Makoto Kamada, <a href="https://stdkmd.net/nrr/prime/prime_difficulty.txt">Search for 303w7</a>.
%e A271822 4 is in this sequence because (91*10^4+11)/3 = 303337 is prime.
%e A271822 Initial terms and associated primes:
%e A271822 a(1) = 1, 307;
%e A271822 a(2) = 2, 3037;
%e A271822 a(3) = 4, 303337;
%e A271822 a(4) = 6, 30333337;
%e A271822 a(5) = 12, 30333333333337, etc.
%t A271822 Select[Range[0, 100000], PrimeQ[(91*10^# + 11)/3] &]
%o A271822 (PARI) lista(nn) = for(n=1, nn, if(ispseudoprime((91*10^n + 11)/3), print1(n, ", "))); \\ _Altug Alkan_, Apr 14 2016
%o A271822 (Magma) [n: n in [1..300] |IsPrime((91*10^n + 11) div 3)]; // _Vincenzo Librandi_, Apr 15 2016
%Y A271822 Cf. A056654, A268448, A269303, A270339, A270613, A270831, A270890, A270929, A271269.
%K A271822 nonn,more
%O A271822 1,2
%A A271822 _Robert Price_, Apr 14 2016
%E A271822 a(31)-a(33) from _Robert Price_, Feb 15 2020