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.

A128158 a(n) = least k such that the remainder when 18^k is divided by k is n.

Original entry on oeis.org

17, 14, 5, 7, 13, 106, 11, 158, 927, 314, 6767, 15, 724317787, 62, 21, 20, 407, 19, 319, 38, 39, 302, 150698261, 30, 1055599, 298, 129, 74
Offset: 1

Views

Author

Alexander Adamchuk, Feb 16 2007

Keywords

Comments

10^15 < a(29) <= 3612834616189533302730621726282897865691021. - Max Alekseyev, Apr 14 2012

Crossrefs

Programs

  • Mathematica
    t = Table[0, {10000}]; k = 1; While[k < 3000000000, a = PowerMod[18, k, k]; If[a < 10001 && t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++ ]; t (* Robert G. Wilson v, Jun 23 2009 *)

Extensions

a(13)-a(28) from Robert G. Wilson v, Jun 23 2009