The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053453 Multiplicative order of 10 mod n, where gcd(n, 10) = 1. 8
 1, 1, 6, 1, 2, 6, 16, 18, 6, 22, 3, 28, 15, 2, 3, 6, 5, 21, 46, 42, 16, 13, 18, 58, 60, 6, 33, 22, 35, 8, 6, 13, 9, 41, 28, 44, 6, 15, 96, 2, 4, 34, 53, 108, 3, 112, 6, 48, 22, 5, 42, 21, 130, 18, 8, 46, 46, 6, 42, 148, 75, 16, 78, 13, 66, 81, 166, 78, 18, 43, 58, 178, 180, 60 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Muniru A Asiru, Table of n, a(n) for n = 1..10000 MATHEMATICA MultiplicativeOrder[10, #] & /@ Select[ Range@ 190, GCD[10, #] == 1 &] (* Robert G. Wilson v, Apr 05 2011 *) PROG (PARI) lista(nn) = {for (n=1, nn, if (gcd(n, 10) == 1, print1(znorder(Mod(10, n)), ", ")); ); } \\ Michel Marcus, Feb 06 2015 (GAP) List(Filtered([1..200], n->Gcd(n, 10)=1), n->OrderMod(10, n)); # Muniru A Asiru, Feb 25 2019 CROSSREFS Cf. A002329. [R. J. Mathar, Oct 13 2008] Sequence in context: A112828 A085766 A002329 * A156792 A021624 A021066 Adjacent sequences:  A053450 A053451 A053452 * A053454 A053455 A053456 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 21 06:10 EDT 2021. Contains 343146 sequences. (Running on oeis4.)