|
Search: id:A067060
|
|
|
| A067060 |
|
A permutation of the natural numbers. |
|
+0
2
|
|
| 3, 1, 4, 2, 7, 5, 8, 6, 11, 9, 12, 10, 15, 13, 16, 14, 19, 17, 20, 18, 23, 21, 24, 22, 27, 25, 28, 26, 31, 29, 32, 30, 35, 33, 36, 34, 39, 37, 40, 38, 43, 41, 44, 42, 47, 45, 48, 46, 51, 49, 52, 50, 55, 53, 56, 54, 59, 57, 60, 58, 63, 61, 64, 62, 67, 65, 68, 66, 71, 69, 72, 70
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Start with the sequence of natural numbers. Rearrange the sequence such that no two consecutive numbers are adjacent, by the following process.
Move 1 by the minimum number of steps required to the right.
Move 2 by the minimum number of steps required to the right. etc.
Move the first element which is required to be moved by the minimum number of steps in the sequence obtained by the previous step.
Initial sequence 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,...
after one step : 2,3,1,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,...
after two steps: 3,1,4,2,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,...
after 3 steps:.. 3,1,4,2,6,7,5,8,9,10,11,12,13,14,15,16,17,18,19,...
Start with 3. Decrease by 2 then increase by 3 then decrease by 2 and then increase by 5 to obtain first five terms. Repeat the process for getting the subsequent terms.
|
|
CROSSREFS
|
Cf. A067061.
Sequence in context: A066899 A139432 A115208 this_sequence A115659 A068028 A163359
Adjacent sequences: A067057 A067058 A067059 this_sequence A067061 A067062 A067063
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 03 2002
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Apr 03 2002
|
|
|
Search completed in 0.002 seconds
|
