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 #19 Feb 19 2019 01:25:31
%S 1,1,2,10,12,16,9,11,5,14,6,2,4,40,3,23,14,26,10,58,60,12,33,35,36,10,
%T 78,82,16,88,12,9,12,10,102,106,108,112,11,16,110,25,126,130,18,136,
%U 23,60,14,37,150,6,156,22,27,83,156,43,10,178,60,4,80,19,96,14,198,14,40
%N Multiplicative order of 6 mod n, where gcd(n, 6) = 1.
%C Essentially the same as A050978. [_R. J. Mathar_, Oct 13 2008]
%H Muniru A Asiru, <a href="/A053449/b053449.txt">Table of n, a(n) for n = 1..10000</a>
%t MultiplicativeOrder[6, #] & /@ Select[ Range@ 200, GCD[#, 6] == 1 &] (* _Robert G. Wilson v_, Apr 05 2011 *)
%o (PARI) lista(nn) = {for(n=1, nn, if (gcd(n, 6) == 1, print1(znorder(Mod(6, n)), ", ")););} \\ _Michel Marcus_, Feb 09 2015
%o (GAP) List(Filtered([1..210],n->Gcd(n,6)=1),n->OrderMod(6,n)); # _Muniru A Asiru_, Feb 17 2019
%Y Cf. A050978.
%K nonn
%O 1,3
%A _David W. Wilson_