|
Search: id:A059888
|
|
|
| A059888 |
|
a(n)=|{m : multiplicative order of 6 mod m=n}|. |
|
+0
3
|
|
| 2, 2, 2, 4, 4, 10, 2, 8, 12, 40, 6, 108, 6, 42, 40, 48, 30, 100, 6, 332, 10, 22, 30, 376, 26, 118, 48, 332, 2, 1436, 6, 448, 54, 222, 88, 7952, 62, 54, 54, 2680, 6, 698, 30, 476, 1476, 222, 14, 7632, 28, 438
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The multiplicative order of a mod m, GCD(a,m)=1, is the smallest natural number d for which a^d = 1 (mod m).
|
|
FORMULA
|
a(n)=Sum_{ d divides n } mu(n/d)*tau(6^d-1), (mu(n) = Moebius function A008683, tau(n) = number of divisors of n A000005).
|
|
CROSSREFS
|
Cf. A000005, A008683, A053449, A059499, A059885, A059886, A059888-A059892.
Sequence in context: A132325 A010238 A089819 this_sequence A024681 A007495 A122385
Adjacent sequences: A059885 A059886 A059887 this_sequence A059889 A059890 A059891
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 06 2001
|
|
|
Search completed in 0.002 seconds
|
