id:A037179 - OEIS Search Results

Search: id:A037179

Displaying 1-1 of 1 results found.

page 1

Number of cycles when squaring modulo n-th prime.

+0
1

2, 2, 2, 3, 3, 3, 2, 4, 3, 4, 6, 4, 3, 7, 4, 3, 3, 6, 6, 7, 4, 6, 4, 3, 3, 4, 9, 3, 5, 4, 14, 8, 4, 7, 3, 9, 6, 6, 3, 5, 10, 9, 6, 3, 6, 9, 16, 6, 6, 6, 3, 10, 6, 5, 2, 3, 3, 12, 7, 7, 7, 10, 14, 15, 6, 4, 15, 7, 3, 6, 3, 3, 6, 15, 21, 4, 4, 9, 4, 9, 6, 16, 12, 5, 19, 13, 4, 6, 7, 16, 10, 4, 7, 11, 6 (list; graph; listen)

	OFFSET	`1,1`
	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: A064740 A080967 A078570 this_sequence A127971 A086673 A101787` `Adjacent sequences: A037176 A037177 A037178 this_sequence A037180 A037181 A037182`
	KEYWORD	`nonn`
	AUTHOR	`Jud McCranie (j.mccranie(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research