A023161 - OEIS

This site is supported by donations to The OEIS Foundation.

A023161

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

1, 2, 2, 2, 2, 4, 4, 2, 4, 4, 2, 4, 4, 8, 4, 2, 2, 8, 10, 4, 8, 4, 7, 4, 2, 8, 10, 8, 3, 8, 4, 2, 4, 4, 8, 8, 10, 20, 8, 4, 2, 16, 7, 4, 8, 14, 3, 4, 7, 4, 4, 8, 4, 20, 4, 8, 20, 6, 3, 8, 4, 8, 16, 2, 8, 8, 19, 4, 14, 16, 3, 8, 10, 20, 4, 20, 8, 16, 10, 4, 16, 4, 10, 16, 4, 14, 6, 4, 7, 16, 16, 14, 8, 6, 20 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`Not multiplicative; the smallest counterexample is a(667). - T. D. Noe (noe(AT)sspectra.com), Nov 14 2006`
	LINKS	`David W. Wilson, Table of n, a(n) for n=1..10000`
	CROSSREFS	`Cf. A023153` `Cf. A023153-A023160 (cycles of the functions f(x)=x^k mod n for k=2..9)` `Sequence in context: A179004 A143979 A034877 * A023155 A085311 A052273` `Adjacent sequences: A023158 A023159 A023160 * A023162 A023163 A023164`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.