%I A125159
%S A125159 1,1,2,3,1,4,2,5,3,1,6,4,7,2,8,5,9,3,10,11,1,6,12,13,4,7,14,2,15,16,8,
%T A125159 17,5,18,9,19,3,20,10,21,11,1,22,6,23,24,12,25,13,4,26,27,7,28,14,2,29,
%U A125159 30,15,31,16,32,8,33,17,34,5,35,18,36,9,37,19,38,3,39,20,40,10,41,21,42
%N A125159 The fractal sequence associated with A125151.
%C A125159 If you delete the first occurrence of each n, the remaining sequence 
               is the original sequence; thus the sequence contains itself as a 
               proper subsequence (infinitely many times).
%D A125159 C. Kimberling, "Interspersions and fractal sequences associated with 
               fractions (c^j)/(d^k)," preprint, 2006.
%H A125159 C. Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/fractals.html">
               Fractal Sequences</a>.
%F A125159 a(n)=number of the row of array A125151 that contains n.
%e A125159 1 is in row 1 of A125151; 2 in row 1; 3 in row 2;
%e A125159 4 in row 3; 5 in row 1; 6 in row 4, so the fractal
%e A125159 sequence starts with 1,1,2,3,1,4
%Y A125159 Cf. A125151.
%Y A125159 Sequence in context: A122196 A023117 A023127 this_sequence A023119 A118276 
               A023123
%Y A125159 Adjacent sequences: A125156 A125157 A125158 this_sequence A125160 A125161 
               A125162
%K A125159 nonn
%O A125159 1,3
%A A125159 Clark Kimberling (ck6(AT)evansville.edu), Nov 21 2006