|
Search: id:A037178
|
|
|
| A037178 |
|
Longest cycle when squaring modulo n-th prime. |
|
+0
2
|
|
| 1, 1, 1, 2, 4, 2, 1, 6, 10, 3, 4, 6, 4, 6, 11, 12, 28, 4, 10, 12, 6, 12, 20, 10, 2, 20, 8, 52, 18, 3, 6, 12, 8, 22, 36, 20, 12, 54, 82, 14, 11, 12, 36, 2, 21, 30, 12, 36, 28, 18, 28, 24, 4, 100, 1, 130, 66, 36, 22, 12, 46, 9, 24, 20, 12, 39, 20, 6, 172, 28, 10, 178, 60, 10, 18
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
a(n)=1 for Fermat primes, A019434. a(n)=2 for primes in A039687. a(n)=3 for primes in A050527. Sequence A141305 gives those primes p > 3 having the longest possible cycle, (p-3)/2. - T. D. Noe, Jun 24 2008
|
|
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
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
FORMULA
|
Let p=prime(n) and k=A000265(p-1), the odd part of p-1. Then a(n) = ord(2,k), that is, the smallest positive integer x such that 2^x = 1 (mod k). - T. D. Noe, Jun 24 2008
|
|
CROSSREFS
|
Sequence in context: A021417 A105791 A116515 this_sequence A113973 A123330 A072865
Adjacent sequences: A037175 A037176 A037177 this_sequence A037179 A037180 A037181
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jud McCranie (j.mccranie(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
