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 #4 Mar 30 2012 18:57:06
%S 1,1,2,1,3,4,2,1,5,3,6,4,7,2,8,1,9,5,10,11,3,6,12,13,4,7,14,2,15,16,8,
%T 1,17,18,9,19,5,20,10,21,11,3,22,6,23,24,12,25,13,4,26,27,7,28,14,2,
%U 29,30,15,31,16,32,8,1,33,34,17,35,18,36,9,37,19,38,5,39,20,40,10,41,21,42,11
%N The fractal sequence associated with A125150.
%C 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 Clark Kimberling, Interspersions and fractal sequences associated with fractions (c^j)/(d^k), Journal of Integer Sequences 10 (2007, Article 07.5.1) 1-8.
%H C. Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/fractals.html">Fractal Sequences</a>.
%F a(n)=number of the row of array A125150 that contains n.
%e 1 is in row 1 of A125150; 2 in row 1; 3 in row 2;
%e 4 in row 1; 5 in row 3; 6 in row 4, so the fractal
%e sequence starts with 1,1,2,1,3,4
%Y Cf. A125150.
%K nonn
%O 1,3
%A _Clark Kimberling_, Nov 21 2006