%I #9 May 23 2015 18:46:20
%S 1,1,2,1,2,1,3,2,1,3,2,4,1,3,2,4,1,3,5,2,4,1,3,5,2,4,6,1,3,5,2,4,6,1,
%T 3,5,7,2,4,6,1,3,5,7,2,4,6,8,1,3,5,7,2,4,6,8,1,3,5,7,9,2,4,6,8,1,3,5,
%U 7,9,2,4,6,8,10,1,3,5,7,9,2,4,6,8,10,1,3,5,7,9,11,2,4,6,8,10,1,3,5,7,9,11,2
%N a(n) = number of the row (counting from initial row 1) of the array R in A087465 that contains n.
%C A sequence that contains itself as a proper subsequence (infinitely many times); that is, a fractal sequence.
%H Clark Kimberling and John E. Brown, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL7/Kimberling/kimber67.html">Partial Complements and Transposable Dispersions</a>, J. Integer Seqs., Vol. 7, 2004.
%F A087466(n)+1
%e Northwest corner of R:
%e 1 2 4 6 9
%e 3 5 8 11 15
%e 7 10 14 18 23
%e 12 16 21 26 32
%e 19 24 30 36 43
%e a(10)=3 because 10 is in row 3.
%Y Cf. A087465, A087466.
%K nonn
%O 1,3
%A _Clark Kimberling_, Sep 09 2003