|
Search: id:A057593
|
|
|
| A057593 |
|
Triangle T(n,k) giving period of sequence k^i (i=0,1,2,...) mod n (n >= 2, 2<=k<=n). |
|
+0
4
|
|
| 1, 2, 1, 1, 2, 1, 4, 4, 2, 1, 2, 1, 1, 2, 1, 3, 6, 3, 6, 2, 1, 1, 2, 1, 2, 1, 2, 1, 6, 1, 3, 6, 1, 3, 2, 1, 4, 4, 2, 1, 1, 4, 4, 2, 1, 10, 5, 5, 5, 10, 10, 10, 5, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 12, 3, 6, 4, 12, 12, 4, 3, 6, 12, 2, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
Adding an initial 1 to this sequence would make the constraint on k be 1<=k<n, which would be nicer. The first rows would then be 1; 1,2; 1,1,2; 1,4,4,2. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jan 19 2006
|
|
EXAMPLE
|
If n=7, k=2, the sequence is 1,2,4,1,2,4,1,2,4,.... of period 3, so T(7,2) = 3.
1; 2,1; 1,2,1; 4,4,2,1; ...
|
|
CROSSREFS
|
Cf. A057594, A057595.
Cf. A086145 (prime rows).
Sequence in context: A002070 A106052 A050473 this_sequence A117008 A126127 A102578
Adjacent sequences: A057590 A057591 A057592 this_sequence A057594 A057595 A057596
|
|
KEYWORD
|
easy,nonn,tabl,nice
|
|
AUTHOR
|
Gottfried Helms (helms(AT)uni-kassel.de), Oct 05 2000
|
|
|
Search completed in 0.002 seconds
|
