The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053452 Multiplicative order of 9 mod n, where gcd(n, 9) = 1. 9
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
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
Sequence in context: A131227 A190257 A050981 * A023986 A306732 A109202
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 8 17:52 EDT 2024. Contains 373227 sequences. (Running on oeis4.)