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.

A090938 Least multiple of n == 1 (mod prime(n)).

Original entry on oeis.org

1, 4, 6, 8, 45, 66, 35, 96, 162, 30, 187, 408, 247, 560, 330, 160, 119, 306, 1140, 640, 147, 396, 1495, 624, 1650, 910, 1134, 1820, 2726, 1470, 1271, 2752, 1782, 1530, 4620, 756, 629, 5054, 1170, 520, 5371, 5250, 1720, 5984, 7290, 598, 423, 3792, 6811, 7100
Offset: 1

Views

Author

Amarnath Murthy, Dec 29 2003

Keywords

Crossrefs

Cf. A090939.

Programs

  • Mathematica
    mn1[n_]:=Module[{k=1,pn=Prime[n]},While[Mod[k n,pn]!=1,k++];k n]; Array[mn1,50] (* Harvey P. Dale, May 12 2012 *)

Extensions

Corrected and extended by Ray Chandler, Jan 01 2004