login
A211449
(p-1)/x, where p = prime(n) and x = ord(4,p), the smallest positive integer such that 4^x == 1 mod p.
6
0, 2, 2, 2, 2, 2, 4, 2, 2, 2, 6, 2, 4, 6, 2, 2, 2, 2, 2, 2, 8, 2, 2, 8, 4, 2, 2, 2, 6, 8, 18, 2, 4, 2, 2, 10, 6, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 6, 2, 6, 8, 2, 20, 10, 32, 2, 2, 2, 6, 8, 6, 2, 6, 2, 4, 2, 22, 16, 2, 2, 8, 2, 2, 2, 2, 2, 2, 18, 4, 4, 2, 2, 10, 12
OFFSET
1,2
MATHEMATICA
nn = 4; Table[If[Mod[nn, p] == 0, 0, (p-1)/MultiplicativeOrder[nn, p]], {p, Prime[Range[100]]}]
KEYWORD
nonn
AUTHOR
T. D. Noe, Apr 11 2012
STATUS
approved