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.

A178197 Smallest k such that 36^k mod k = n.

Original entry on oeis.org

1, 5, 17, 11, 34, 31, 10, 29, 14, 213, 13, 1585, 39, 23, 1282, 21, 20, 19, 142, 56413361, 22, 445, 26, 169, 87, 341, 50, 33, 332, 33607, 57, 55329163, 158, 46623, 1262, 33763, 37, 167987937385549, 74, 123, 284, 12091, 51, 119, 626, 531, 2630, 960641, 104, 473, 98, 75, 116, 424381, 174, 7751, 62, 951, 781, 364789, 206, 545, 1234, 93, 77, 205591, 78, 51367, 614, 159, 1226, 623, 207, 23147, 94, 11847, 100, 3551, 161, 332089, 176, 99, 143, 361841, 202, 73969, 590, 129, 302
Offset: 0

Views

Author

Artur Jasinski, May 23 2010

Keywords

Crossrefs

Programs

  • Mathematica
    aa = {}; Do[k = 1; While[PowerMod[36, k, k] != n, k++ ]; Print[k]; AppendTo[aa, k], {n, 0, 50}]; aa

Extensions

Terms a(37) onward from Max Alekseyev, May 07 2012