id:A023157 - OEIS Search Results

Search: id:A023157

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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; listen)

	OFFSET	`1,2`
	COMMENT	`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-A023161 (cycles of the functions f(x)=x^k mod n for k=2..10)` `Sequence in context: A034444 A073180 A127973 this_sequence A069733 A081755 A097859` `Adjacent sequences: A023154 A023155 A023156 this_sequence A023158 A023159 A023160`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research