A023157 - OEIS

A023157

Number of cycles of function f(x) = x^6 mod n.

1, 2, 2, 2, 2, 4, 2, 2, 2, 4, 6, 4, 2, 4, 4, 2, 2, 4, 2, 4, 4, 12, 3, 4, 6, 4, 2, 4, 5, 8, 6, 2, 12, 4, 4, 4, 2, 4, 4, 4, 6, 8, 5, 12, 4, 6, 4, 4, 5, 12, 4, 4, 3, 4, 12, 4, 4, 10, 4, 8, 6, 12, 4, 2, 4, 24, 3, 4, 6, 8, 21, 4, 2, 4, 12, 4, 12, 8, 3, 4, 2, 12, 3, 8, 4, 10, 10, 12, 3, 8, 4, 6, 12, 8, 4, 4, 2, 10, 12

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Not multiplicative; the smallest counterexample is a(667). - T. D. Noe, Nov 14 2006

LINKS

David W. Wilson, Table of n, a(n) for n=1..10000

CROSSREFS

Cf. A023153-A023161 (cycles of the functions f(x)=x^k mod n for k=2..10).

Sequence in context: A317684 A127973 A300654 * A228849 A359541 A069733

Adjacent sequences: A023154 A023155 A023156 * A023158 A023159 A023160

KEYWORD

nonn

AUTHOR

David W. Wilson

STATUS

approved