login
A023159
Number of cycles of function f(x) = x^8 mod n.
1
1, 2, 2, 2, 2, 4, 3, 2, 3, 4, 3, 4, 3, 6, 4, 2, 2, 6, 6, 4, 6, 6, 3, 4, 3, 6, 6, 6, 8, 8, 6, 2, 6, 4, 6, 6, 6, 12, 6, 4, 3, 12, 15, 6, 6, 6, 4, 4, 15, 6, 4, 6, 5, 12, 6, 6, 12, 16, 3, 8, 6, 12, 10, 2, 6, 12, 6, 4, 6, 12, 15, 6, 6, 12, 6, 12, 10, 12, 12, 4, 9, 6, 4, 12, 4, 30, 16, 6, 3, 12, 10, 6, 12, 8, 12, 4
OFFSET
1,2
COMMENTS
Not multiplicative; the smallest counterexample is a(63). - T. D. Noe, Nov 14 2006
LINKS
CROSSREFS
Cf. A023153-A023161 (cycles of the functions f(x)=x^k mod n for k=2..10)
Sequence in context: A064486 A153437 A023153 * A098983 A097576 A029250
KEYWORD
nonn
STATUS
approved