A053452 Multiplicative order of 9 mod n, where gcd(n, 9) = 1.
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
Offset: 1
Keywords
Links
- Muniru A Asiru, Table of n, a(n) for n = 1..10000
Programs
-
GAP
List(Filtered([1..210],n->Gcd(n,9)=1),n->OrderMod(9,n)); # Muniru A Asiru, Feb 17 2019
-
Mathematica
MultiplicativeOrder[9, #] & /@ Select[ Range@ 125, GCD[9, #] == 1 &] (* Robert G. Wilson v, Apr 05 2011 *)
-
PARI
lista(nn) = {for(n=1, nn, if (gcd(n, 9) == 1, print1(znorder(Mod(9, n)), ", ")););} \\ Michel Marcus, Feb 09 2015
Comments