|
Search: id:A057063
|
|
|
| A057063 |
|
Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...,s(n) fixed and reverse-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. The limit of PS(n) is A057063. |
|
+0
1
|
|
| 1, 2, 4, 6, 3, 10, 12, 7, 16, 18, 11, 22, 13, 5, 28, 30, 19, 20, 36, 23, 40, 42, 9, 46, 29, 31, 52, 37, 35, 58, 60, 15, 44, 66, 43, 70, 72, 25, 54, 78, 8, 82, 61, 55, 88, 65, 59, 68, 96, 27, 100, 102, 38, 106, 108, 71, 112, 85, 33, 89, 94, 79
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
PS(2) begins with 1,2,4,3,6,5,8; PS(3) with 1,2,4,6,5,3,7; PS(4) with 1,2,4,6,3,7,10.
|
|
CROSSREFS
|
Sequence in context: A096665 A064413 A122280 this_sequence A002849 A072984 A018841
Adjacent sequences: A057060 A057061 A057062 this_sequence A057064 A057065 A057066
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Aug 01 2000
|
|
|
Search completed in 0.002 seconds
|
