login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072288 Smallest prime factor of Googolplex + n which exceeds 16. 4
316912650057057350374175801344000001 (list; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Second term is not known. Sequence continues ?, 1429, 1129, 29, ?, 53, 427169, 5501, 19, 59, 1327, 1645318771, 61, 211, 17, 1831, ?, 43, 389, 173, 233886337, 139, 1451, 18797, 31, 37, 8297, 19, 13879, ?, 9241, 17, 29, ...

All unknown members of the sequence must be greater than 10^14. - Dario Alpern, May 17 2003

a(1) is unknown: the smallest known example is 316912650057057350374175801344000001. - Arkadiusz Wesolowski, Nov 01 2013

LINKS

Table of n, a(n) for n=1..1.

Tanya Khovanova, Non Recursions

Dario Alejandro Alpern, Factors of 1000 numbers starting from googolplex

Robert Harley, Factors of Googolplex+1 (Found some terms)

Eric Weisstein's World of Mathematics, Googolplex

MATHEMATICA

(* For any individual n *) k = 17; While[ !PrimeQ[k] || PowerMod[10, 10^100, k] + n != k, k += 2]; k

CROSSREFS

Cf. A078814.

Sequence in context: A272521 A095464 A255360 * A341116 A323538 A003854

Adjacent sequences:  A072285 A072286 A072287 * A072289 A072290 A072291

KEYWORD

hard,nonn,bref,more,less

AUTHOR

Ed Pegg Jr and Robert G. Wilson v, Nov 21 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:57 EDT 2021. Contains 343204 sequences. (Running on oeis4.)