Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Dec 05 2013 19:55:19
%S 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 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 108,0,112,11,0,16,110,0,25,126,0,130,18,0,136,23,0,60
%N Smallest m in range 1..phi(2n+1) such that 6^m == 1 mod 2n+1, or 0 if no such number exists.
%Y Cf. A070667-A070675, A002326, A070676, A053447, A070677, A070678, A053451, A070679, A070682, A070680, A070683.
%K nonn
%O 0,4
%A _N. J. A. Sloane_ and _Amarnath Murthy_, May 08 2002