The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053449 Multiplicative order of 6 mod n, where gcd(n, 6) = 1. 3
 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, 78, 82, 16, 88, 12, 9, 12, 10, 102, 106, 108, 112, 11, 16, 110, 25, 126, 130, 18, 136, 23, 60, 14, 37, 150, 6, 156, 22, 27, 83, 156, 43, 10, 178, 60, 4, 80, 19, 96, 14, 198, 14, 40 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Essentially the same as A050978. [R. J. Mathar, Oct 13 2008] LINKS Muniru A Asiru, Table of n, a(n) for n = 1..10000 MATHEMATICA MultiplicativeOrder[6, #] & /@ Select[ Range@ 200, GCD[#, 6] == 1 &] (* Robert G. Wilson v, Apr 05 2011 *) PROG (PARI) lista(nn) = {for(n=1, nn, if (gcd(n, 6) == 1, print1(znorder(Mod(6, n)), ", ")); ); } \\ Michel Marcus, Feb 09 2015 (GAP) List(Filtered([1..210], n->Gcd(n, 6)=1), n->OrderMod(6, n)); # Muniru A Asiru, Feb 17 2019 CROSSREFS Cf. A050978. Sequence in context: A108064 A057989 A050978 * A211242 A060248 A092385 Adjacent sequences: A053446 A053447 A053448 * A053450 A053451 A053452 KEYWORD nonn AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 11:19 EST 2022. Contains 358468 sequences. (Running on oeis4.)