|
Search: id:A057032
|
|
|
| A057032 |
|
Let P(n) of a sequence s(1), s(2), s(3), ... be obtained by leaving s(1), ..., s(n-1) fixed and forward-cyclically permuting every n consecutive terms thereafter; apply P(2) to 1, 2, 3, ... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. This limit of PS(n) is A057032. |
|
+0
2
|
|
| 1, 3, 4, 7, 6, 10, 8, 16, 15, 21, 12, 22, 14, 27, 28, 36, 18, 33, 20, 43, 35, 39, 24, 53, 34, 45, 46, 50, 30, 66, 32, 78, 52, 57, 55, 81, 38, 63, 59, 88, 42, 86, 44, 96, 87, 75, 48, 119, 64, 111, 76, 101, 54, 103, 79, 144, 83, 93, 60, 141, 62, 99, 113, 173, 91, 136, 68, 139
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
PS(2) begins with 1, 3, 2, 5, 4, 7, 6; PS(3) with 1, 3, 4, 2, 5, 9, 7; PS(4) with 1, 3, 4, 7, 2, 5, 9.
|
|
PROGRAM
|
(Matlab) function m = A057032(i) m = PS(i, i); function m = PS(i, n) if i == 1 m = n; elseif n < i m = PS(i - 1, n); else if mod(n, i) == 0 m = PS(i - 1, n + i - 1); else m = PS(i - 1, n - 1); end end
|
|
CROSSREFS
|
Cf. A069829.
Sequence in context: A086469 A087030 A126253 this_sequence A113957 A073185 A073183
Adjacent sequences: A057029 A057030 A057031 this_sequence A057033 A057034 A057035
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Jul 29 2000
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Apr 22 2002
|
|
|
Search completed in 0.002 seconds
|
