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.

A178199 Smallest k such that 38^k mod k = n.

Original entry on oeis.org

1, 37, 3, 5, 6, 11, 1438, 31, 9, 29, 18, 45021, 13, 5249, 22, 23, 20, 69, 25, 437, 21, 227643018837677, 42, 141, 50, 19877, 27, 121, 36, 303, 98, 49, 75, 329, 94, 261, 116, 9200543, 39, 87541720241623, 52, 1119, 1402, 510025, 356, 24829, 466, 51
Offset: 0

Views

Author

Artur Jasinski, May 23 2010

Keywords

Crossrefs

Programs

  • Mathematica
    aa = {}; Do[k = 1; While[PowerMod[38, k, k] != n, k++ ]; Print[{n, k}]; AppendTo[aa, k], {n, 1, 50}]; aa
    sk[n_]:=Module[{k=1},While[PowerMod[38,k,k]!=n,k++];k]; Array[sk,50,0] (* Harvey P. Dale, Mar 14 2015 *)

Extensions

Terms a(21) onward from Max Alekseyev, Apr 22 2012