login

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”).

A110949
Integers n such that 4*10^n + 61 is prime.
0
1, 2, 7, 11, 191, 248, 1067, 2666, 5252, 13400, 22886, 23739, 29095
OFFSET
1,2
COMMENTS
See Kamada link - primecount.txt for terms, primesize.txt for discovery details including probable or proved primes - search on "40061".
a(14) > 10^5. - Robert Price, Jan 22 2017
EXAMPLE
n = 7 is in the sequence because 4*10^7 + 61 = 4*10000000 + 61 = 40000000 + 61 = 40000061, which is prime.
PROG
(PARI) isok(n) = isprime(4*10^n+61); \\ Michel Marcus, Jan 22 2017
KEYWORD
more,nonn
AUTHOR
Julien Peter Benney (jpbenney(AT)ftml.net), Oct 04 2005
EXTENSIONS
a(9)-a(11) from Ray Chandler, Dec 23 2010
Prepended a(1)=1 by Robert Price, Jan 22 2017
a(12)-a(13) from Robert Price, Jan 22 2017
STATUS
approved