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