cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A067007 a(n) = googolplex (mod n).

Original entry on oeis.org

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
Offset: 1

Views

Author

Ed Pegg Jr, Nov 20 2002

Keywords

Comments

A googolplex is 10^(10^100). a(n) = 0 iff n = 2^a * 5^b, a, b >= 0 (A003592).

Crossrefs

Cf. A066298.

Programs

  • Mathematica
    Table[ PowerMod[10, 10^100, n], {n, 2, 50}]

Extensions

Edited by Robert G. Wilson v, Nov 23 2002