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