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

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185121 Smallest prime factor of 10^(2^n) + 1. 7
11, 101, 73, 17, 353, 19841, 1265011073, 257, 10753, 1514497, 1856104284667693057, 106907803649, 458924033, 3635898263938497962802538435084289 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
10^k+1 can only be prime if k is a power of 2. So far the only known primes of this form are a(0) = 11 and a(1) = 101. [Edited by M. F. Hasler, Aug 03 2019]
a(n) >= 2^(n+1)+1; we have a(n) = 2^(n+1)+1 for n=3, n=7, and n=15.
a(14) > 10^16. - Max Alekseyev, Jun 28 2013
From the Keller link a(15)-a(20) = 65537, 8257537, 175636481, 639631361, 70254593, 167772161. - Ray Chandler, Dec 27 2013
LINKS
FORMULA
a(n) = A038371(2^n). - M. F. Hasler, Jul 30 2019
EXAMPLE
For n=2, a(2)=73 since 10^(2^2) + 1 = 10001 = 73 * 137.
MATHEMATICA
Table[With[{k = 2^n}, FactorInteger[10^k + 1]][[1, 1]], {n, 0, 13, 1}] (* Vincenzo Librandi, Jul 23 2013 *)
PROG
(PARI) a(n) = factor(10^(2^n)+1)[1, 1] \\ Michel Marcus, May 30 2013
CROSSREFS
Essentially the same as A102050. - Sean A. Irvine, Feb 17 2013
Sequence in context: A330290 A330291 A318647 * A133835 A326108 A292451
KEYWORD
nonn,more,hard
AUTHOR
Sergio Pimentel, Jan 22 2012
STATUS
approved

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 December 10 04:38 EST 2023. Contains 367699 sequences. (Running on oeis4.)