|
|
A211450
|
|
(p-1)/x, where p = prime(n) and x = ord(5,p), the smallest positive integer such that 5^x == 1 mod p.
|
|
6
|
|
|
1, 1, 0, 1, 2, 3, 1, 2, 1, 2, 10, 1, 2, 1, 1, 1, 2, 2, 3, 14, 1, 2, 1, 2, 1, 4, 1, 1, 4, 1, 3, 2, 1, 2, 4, 2, 1, 3, 1, 1, 2, 12, 10, 1, 1, 6, 6, 1, 1, 2, 1, 2, 6, 10, 1, 1, 4, 10, 1, 2, 1, 1, 1, 2, 39, 1, 2, 3, 1, 2, 1, 2, 3, 1, 18, 1, 4, 1, 16, 24, 2, 2, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
MATHEMATICA
|
nn = 5; Table[If[Mod[nn, p] == 0, 0, (p-1)/MultiplicativeOrder[nn, p]], {p, Prime[Range[100]]}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|