|
Search: id:A067061
|
|
|
| A067061 |
|
A permutation of the natural numbers. |
|
+0
2
|
|
| 4, 1, 5, 2, 6, 3, 10, 7, 11, 8, 12, 9, 16, 13, 17, 14, 18, 15, 22, 19, 23, 20, 24, 21, 28, 25, 29, 26, 30, 27, 34, 31, 35, 32, 36, 33, 40, 37, 41, 38, 42, 39, 46, 43, 47, 44, 48, 45, 52, 49, 53, 50, 54, 51, 58, 55, 59, 56, 60, 57, 64, 61, 65, 62, 66, 63, 70, 67, 71, 68, 72, 69
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Start with the sequence of natural numbers. Rearrange the sequence so that any two consecutive numbers differ by at least 3, 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,4,1,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,...
after two steps. 3,4,1,5,2,6,7,8,9,10,11,12,13,14,15,16,17,18,19,...
after 3 steps... 4,1,5,2,6,3,8,9,10,7,11,12,13,14,15,16,17,18,19,...
Start with 4. Decrease by 3 then increase by 4 then decrease by 3 and then increase by 4 Decrease by 3 then increase by 7 to obtain first seven terms. Repeat the process for getting the subsequent terms.
|
|
CROSSREFS
|
Cf. A067060.
Adjacent sequences: A067058 A067059 A067060 this_sequence A067062 A067063 A067064
Sequence in context: A076063 A035590 A080414 this_sequence A115210 A030352 A104571
|
|
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
|
