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.

A178196 Smallest k such that 35^k mod k = n.

Original entry on oeis.org

1, 2, 3, 26, 31, 10, 29, 14, 9, 13, 55, 57, 23, 92, 21, 22, 19, 99, 187, 134, 2105, 28, 169, 1202, 593791, 30, 27, 1198, 203, 46, 695, 66, 42843, 248, 4023706859, 37, 449467, 132, 327, 1186, 565, 74, 581, 394, 14277, 110, 59867, 62, 1311139, 56, 75
Offset: 0

Views

Author

Artur Jasinski, May 23 2010

Keywords

Crossrefs

Programs

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

Extensions

Terms a(34) onward from Max Alekseyev, Feb 04 2012