login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A272717 Numbers n such that (65*10^n+691)/9 is prime. 0

%I #31 Jan 17 2019 13:44:08

%S 1,5,7,17,35,46,56,148,187,190,256,551,553,1033,1751,1976,2696,3116,

%T 3364,5353,5893,8063,9548,10640,24655,77992

%N Numbers n such that (65*10^n+691)/9 is prime.

%C For n>1, numbers such that the digit 7 followed by n-2 occurrences of the digit 2 followed by the digits 99 is prime (see Example section).

%C a(27) > 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 72w99.</a>

%e 5 is in this sequence because (65*10^5+691)/9 = 722299 is prime.

%e Initial terms and primes associated:

%e a(1) = 1, 149;

%e a(2) = 5, 722299;

%e a(3) = 7, 72222299;

%e a(4) = 17, 722222222222222299;

%e a(5) = 35, 722222222222222222222222222222222299, etc.

%t Select[Range[0, 100000], PrimeQ[(65*10^#+691)/9] &]

%o (PARI) is(n)=ispseudoprime((65*10^n+691)/9) \\ _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_, Aug 11 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 08:14 EDT 2024. Contains 371769 sequences. (Running on oeis4.)