|
Search: id:A059499
|
|
|
| A059499 |
|
a(n)=|{m : multiplicative order of 2 mod m=n}|. |
|
+0
16
|
|
| 1, 1, 1, 2, 1, 3, 1, 4, 2, 5, 3, 16, 1, 5, 5, 8, 1, 24, 1, 38, 9, 11, 3, 68, 6, 5, 4, 54, 7, 79, 1, 16, 11, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
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).
|
|
EXAMPLE
|
E.g. a(3)=|{7}|=1, a(4)=|{5,15}|=2, a(6)=|{9,21,63}|=3, ...
|
|
CROSSREFS
|
Cf. A001037, A058943.
Sequence in context: A124072 A100053 A029194 this_sequence A113322 A007380 A029171
Adjacent sequences: A059496 A059497 A059498 this_sequence A059500 A059501 A059502
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 04 2001
|
|
EXTENSIONS
|
More terms from John W. Layman (layman(AT)math.vt.edu), Mar 22 2002
|
|
|
Search completed in 0.002 seconds
|
