Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Mar 05 2016 22:27:04
%S 1,3,4,2,7,8,6,11,12,9,15,16,5,19,20,14,23,24,17,27,28,13,31,32,22,35,
%T 36,25,39,40,18,43,44,30,47,48,33,51,52,10,55,56,38,59,60,41,63,64,29,
%U 67,68,46,71,72,49,75,76,34,79,80,54,83,84,57,87,88,26,91,92
%N Start with positive integers. On the m-th step, shift terms a(m+1) to a(2m-1) one position to the left, then move a(m) to position (2m-1). Sequence is limit of reordering.
%C An analysis of this sequence was provided by Keith Ramsay - see link.
%H Ivan Neretin, <a href="/A098003/b098003.txt">Table of n, a(n) for n = 1..10000</a>
%H Keith Ramsay, <a href="http://groups.google.com/group/sci.math/msg/d11ac58ab66884ed">Recursively Rotated Permutation.</a> Posting in newsgroup sci.math, Sep 10 2004
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e [1,2,3,4,5,6,...] -> [1,3,2,4,5,6,...] -> [1,3,4,5,2,6,...] -> [1,3,4,2,6,7,...] -> [1,3,4,2,7,5,...] -> [1,3,4,2,7,8,...] -> ...
%t mx = 69; Take[Fold[Insert[Delete[#1, #2], #1[[#2]], 2 #2 - 1] &, Range[2 mx], Range[mx]], mx] (* _Ivan Neretin_, Mar 05 2016 *)
%Y Cf. A098046 for inverse permutation, A098486 auxiliary sequence explaning the behavior of column 1, if the sequence is written in a 3-entries-per-line table.
%K nonn
%O 1,2
%A _Leroy Quet_, Sep 08 2004
%E More terms from _Hugo Pfoertner_, Sep 08 2004