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.
%I A070680 #12 Oct 22 2024 08:01:43
%S A070680 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,
%T A070680 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,
%U A070680 2,4,30,6,16,12,0,66,16,22,3,70,6,72,6,10,6,0,12,39,4
%N A070680 Smallest m in range 1..phi(n) such that 11^m == 1 mod n, or 0 if no such number exists.
%t A070680 Table[SelectFirst[Range[EulerPhi[n]],PowerMod[11,#,n]==1&,0],{n,80}] (* _Paul F. Marrero Romero_, Oct 21 2024 *)
%o A070680 (Magma) [0] cat [Modorder(11, n): n in [2..100]]; // _Vincenzo Librandi_, Apr 01 2014
%Y A070680 Cf. A070667-A070675, A002326, A070676, A053447, A070677, A070681, A070678, A053451, A070679, A070682, A070683.
%K A070680 nonn
%O A070680 1,3
%A A070680 _N. J. A. Sloane_ and _Amarnath Murthy_, May 08 2002