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 #13 Jan 17 2019 13:44:07
%S 1,4,10,13,178,304,331,502,744,1027,1770,5305,55075
%N Numbers n such that 6*10^n + 8*R_n - 7 is prime, where R_n = 11...1 is the repunit (A002275) of length n.
%C Also numbers n such that (62*10^n-71)/9 is prime.
%C a(14) > 10^5. - _Robert Price_, Sep 15 2015
%H Makoto Kamada, <a href="https://stdkmd.net/nrr/6/68881.htm#prime">Prime numbers of the form 688...881</a>.
%H <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>.
%F a(n) = A101537(n) + 1.
%t Do[ If[ PrimeQ[(62*10^n - 71)/9], Print[n]], {n, 0, 10000}]
%Y Cf. A002275, A101537.
%K more,nonn
%O 1,2
%A _Robert G. Wilson v_, Jan 18 2005
%E a(13) from _Robert Price_, Sep 15 2015