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!)
 A053452 Multiplicative order of 9 mod n, where gcd(n, 9) = 1. 2
 1, 1, 1, 2, 3, 1, 2, 5, 3, 3, 2, 8, 9, 2, 5, 11, 10, 3, 3, 14, 15, 4, 8, 6, 9, 9, 2, 4, 21, 5, 11, 23, 21, 10, 3, 26, 10, 3, 14, 29, 5, 15, 8, 6, 11, 8, 6, 35, 6, 9, 9, 15, 39, 2, 4, 41, 8, 21, 5, 44, 3, 11, 23, 18, 24, 21, 10, 50, 17, 3, 26, 53, 27, 10, 6, 56, 22, 14, 29, 24, 5, 5, 15, 50 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Essentially the same as A050981. [R. J. Mathar, Oct 13 2008] LINKS Muniru A Asiru, Table of n, a(n) for n = 1..10000 MATHEMATICA MultiplicativeOrder[9, #] & /@ Select[ Range@ 125, GCD[9, #] == 1 &] (* Robert G. Wilson v, Apr 05 2011 *) PROG (PARI) lista(nn) = {for(n=1, nn, if (gcd(n, 9) == 1, print1(znorder(Mod(9, n)), ", ")); ); } \\ Michel Marcus, Feb 09 2015 (GAP) List(Filtered([1..210], n->Gcd(n, 9)=1), n->OrderMod(9, n)); # Muniru A Asiru, Feb 17 2019 CROSSREFS Cf. A050981, A070679. Sequence in context: A131227 A190257 A050981 * A023986 A306732 A109202 Adjacent sequences:  A053449 A053450 A053451 * A053453 A053454 A053455 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 18 06:14 EDT 2021. Contains 343072 sequences. (Running on oeis4.)