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.

A070681 Smallest m in range 1..phi(2n+1) such that 6^m == 1 mod 2n+1, or 0 if no such number exists.

This page as a plain text file.
%I A070681 #4 Dec 05 2013 19:55:19
%S A070681 0,0,1,2,0,10,12,0,16,9,0,11,5,0,14,6,0,2,4,0,40,3,0,23,14,0,26,10,0,
%T A070681 58,60,0,12,33,0,35,36,0,10,78,0,82,16,0,88,12,0,9,12,0,10,102,0,106,
%U A070681 108,0,112,11,0,16,110,0,25,126,0,130,18,0,136,23,0,60
%N A070681 Smallest m in range 1..phi(2n+1) such that 6^m == 1 mod 2n+1, or 0 if no such number exists.
%Y A070681 Cf. A070667-A070675, A002326, A070676, A053447, A070677, A070678, A053451, A070679, A070682, A070680, A070683.
%K A070681 nonn
%O A070681 0,4
%A A070681 _N. J. A. Sloane_ and _Amarnath Murthy_, May 08 2002