login
The OEIS is supported by the many generous donors 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. 2
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
LINKS
E. L. Blanton, Jr., S. P. Hurd and J. S. McCranie, On a digraph defined by squaring modulo n, Fibonacci Quart. 30 (Nov. 1992), 322-333.
CROSSREFS
Sequence in context: A257079 A327567 A260372 * A241675 A349273 A091222
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 4 14:53 EDT 2024. Contains 375683 sequences. (Running on oeis4.)