|
|
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.
From the Keller link a(15)-a(20) = 65537, 8257537, 175636481, 639631361, 70254593, 167772161. - Ray Chandler, Dec 27 2013
|
|
LINKS
|
|
|
FORMULA
|
|
|
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
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|