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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067007 a(n) = googolplex (mod n). 2
 0, 0, 1, 0, 0, 4, 4, 0, 1, 0, 1, 4, 3, 4, 10, 0, 1, 10, 9, 0, 4, 12, 13, 16, 0, 16, 10, 4, 24, 10, 5, 0, 1, 18, 25, 28, 10, 28, 16, 0, 1, 4, 24, 12, 10, 36, 9, 16, 4, 0, 1, 16, 46, 10, 45, 32, 28, 24, 48, 40, 47, 36, 46, 0, 55, 34, 10, 52, 13, 60, 45, 64, 1, 10, 25, 28, 67, 16, 52, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS A googolplex is 10^(10^100). a(n) = 0 iff n = 2^a * 5^b, a, b >= 0 (A003592). LINKS Daniel Starodubtsev, Table of n, a(n) for n = 1..10000 Eric Weisstein's World of Mathematics, Googolplex MATHEMATICA Table[ PowerMod[10, 10^100, n], {n, 2, 50}] CROSSREFS Cf. A066298. Sequence in context: A075866 A202168 A156450 * A066298 A108068 A283998 Adjacent sequences:  A067004 A067005 A067006 * A067008 A067009 A067010 KEYWORD nonn AUTHOR Ed Pegg Jr, Nov 20 2002 EXTENSIONS Edited by Robert G. Wilson v, Nov 23 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.

Last modified February 18 21:20 EST 2020. Contains 332028 sequences. (Running on oeis4.)