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.

A070680 Smallest m in range 1..phi(n) such that 11^m == 1 mod n, or 0 if no such number exists.

Original entry on oeis.org

0, 1, 2, 2, 1, 2, 3, 2, 6, 1, 0, 2, 12, 3, 2, 4, 16, 6, 3, 2, 6, 0, 22, 2, 5, 12, 18, 6, 28, 2, 30, 8, 0, 16, 3, 6, 6, 3, 12, 2, 40, 6, 7, 0, 6, 22, 46, 4, 21, 5, 16, 12, 26, 18, 0, 6, 6, 28, 58, 2, 4, 30, 6, 16, 12, 0, 66, 16, 22, 3, 70, 6, 72, 6, 10, 6, 0, 12, 39, 4
Offset: 1

Views

Author

N. J. A. Sloane and Amarnath Murthy, May 08 2002

Keywords

Crossrefs

Programs

  • Magma
    [0] cat [Modorder(11, n): n in [2..100]]; // Vincenzo Librandi, Apr 01 2014
  • Mathematica
    Table[SelectFirst[Range[EulerPhi[n]],PowerMod[11,#,n]==1&,0],{n,80}] (* Paul F. Marrero Romero, Oct 21 2024 *)