A211454 (p-1)/x, where p = prime(n) and x = ord(9,p), the smallest positive integer such that 9^x == 1 mod p.

1, 0, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 10, 2, 2, 2, 2, 12, 6, 2, 12, 2, 2, 2, 4, 2, 6, 2, 4, 2, 2, 2, 2, 2, 2, 6, 4, 2, 2, 2, 2, 4, 2, 24, 2, 2, 2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 18, 4, 2, 2, 2, 18, 2, 8, 2, 2, 4, 2, 4, 2, 2, 6, 4, 2, 2, 2, 4, 2, 4, 2, 4, 10, 16

Offset

1,3

Links

T. D. Noe, Table of n, a(n) for n = 1..1000

Mathematica

nn = 9; Table[If[Mod[nn, p] == 0, 0, (p-1)/MultiplicativeOrder[nn, p]], {p, Prime[Range[100]]}]

Crossrefs

Cf. A001917, A094593, A211449, A211450, A211451, A211452, A211453, A006556.

Sequence in context: A027389 A337539 A111735 * A242310 A102298 A049298

Adjacent sequences: A211451 A211452 A211453 * A211455 A211456 A211457

Keyword

nonn

Author

T. D. Noe, Apr 11 2012

Status

approved