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 #17 Jan 17 2019 13:44:05
%S 0,1,3,6,7,19,27,43,55,207,1311,3204,7050,9439,26044,33058,34507,
%T 49314,119292
%N Numbers n such that 3*10^n - 1 is prime.
%C Also numbers n such that 2*10^n + 9*R_n is prime, where R_n = 11...1 is the repunit (A002275) of length n.
%H Makoto Kamada, <a href="https://stdkmd.net/nrr/2/29999.htm#prime">Prime numbers of the form 299...99</a>.
%H <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>
%t Do[ If[ PrimeQ[ 2*10^n + (10^n-1)], Print[n]], {n, 0, 3000}]
%t Select[Range[200000],PrimeQ[3*10^#-1]&] (* _Harvey P. Dale_, Sep 29 2012 *)
%o (PARI) is(n)=ispseudoprime(3*10^n-1) \\ _Charles R Greathouse IV_, Jun 12 2017
%K hard,nonn,more
%O 1,3
%A _Robert G. Wilson v_, Aug 10 2000
%E More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 01 2008