login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037180 Number of different cycle lengths when squaring modulo n-th prime. 0
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; refs; listen; history; text; internal format)
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.

LINKS

Table of n, a(n) for n=1..102.

CROSSREFS

Sequence in context: A133138 A194326 A194290 * A091222 A064659 A127953

Adjacent sequences:  A037177 A037178 A037179 * A037181 A037182 A037183

KEYWORD

nonn

AUTHOR

Jud McCranie

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified May 22 04:18 EDT 2013. Contains 225511 sequences.