id:A037180 - OEIS Search Results

Search: id:A037180

Displaying 1-1 of 1 results found.

page 1

Number of different cycle lengths when squaring modulo n-th prime.

+0
1

1, 1, 1, 2, 2, 2, 1, 3, 2, 2, 3, 3, 2, 4, 2, 2, 2, 3, 3, 4, 3, 3, 2, 2, 2, 3, 3, 2, 4, 2, 4, 3, 2, 4, 2, 4, 3, 5, 2, 2, 2, 5, 4, 2, 3, 5, 6, 3, 2, 3, 2, 4, 3, 4, 1, 2, 2, 7, 4, 4, 4, 2, 5, 4, 3, 2, 5, 4, 2, 3, 2, 2, 3, 4, 5, 2, 2, 5, 3, 3, 4, 6, 4, 4, 4, 4, 2, 3, 4, 6, 2, 2, 6, 6, 3, 2, 2, 3, 5, 7, 5, 2 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`E. L. Blanton, S. P. Hurd and J. S. McCranie, "On a Digraph Defined by Squaring Modulo n", Fibonacci Quarterly, Vol. 20, #4, 322-334, 11/1992.`
	CROSSREFS	`Sequence in context: A068322 A078687 A133138 this_sequence A091222 A064659 A127953` `Adjacent sequences: A037177 A037178 A037179 this_sequence A037181 A037182 A037183`
	KEYWORD	`nonn`
	AUTHOR	`Jud McCranie (j.mccranie(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research