|
| |
|
|
A059890
|
|
a(n)=|{m : multiplicative order of 8 mod m=n}|.
|
|
2
| |
|
|
2, 4, 2, 18, 6, 24, 10, 72, 4, 84, 14, 462, 14, 128, 54, 672, 30, 124, 14, 4494, 82, 364, 14, 7608, 120, 172, 56, 9054, 62, 3920, 6, 5376, 238, 1500, 1518, 9600, 62, 364, 494, 69048
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The multiplicative order of a mod m, gcd(a,m)=1, is the smallest natural number d for which a^d = 1 (mod m). a(n)=number of orders of degree-n monic irreducible polynomials over GF(8).
|
|
|
FORMULA
| a(n)=Sum_{ d divides n } mu(n/d)*tau(8^d-1), (mu(n) = Moebius function A008683, tau(n) = number of divisors of n A000005).
|
|
|
CROSSREFS
| Cf. A000005, A008683, A027380, A053451, A058946, A059499, A059885-A059889, A059891-A059892.
Sequence in context: A152878 A186526 A100944 * A006496 A130172 A029589
Adjacent sequences: A059887 A059888 A059889 * A059891 A059892 A059893
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 06 2001
|
| |
|
|
