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.

A178195 Smallest k such that 34^k mod k = n.

Original entry on oeis.org

1, 3, 1154, 31, 5, 29, 7, 39297, 13, 19055, 18, 23, 22, 21, 535, 19, 20, 62537, 1138, 45, 142, 2092793, 42, 19547, 25, 39279, 50, 749, 36, 39055, 1126, 39, 188, 93641, 35, 634815079, 70, 171, 86, 355, 52, 65387, 713, 69, 148, 253, 74
Offset: 0

Views

Author

Artur Jasinski, May 23 2010

Keywords

Comments

First unknown term is a(47), where there are no solutions < 2904290724.
For a catalog of sequences of the kind "smallest k such that m^k mod k = n," see A178194.

Crossrefs

Programs

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