|
%I #4 Mar 30 2012 18:57:06
%S 1,2,3,1,4,2,5,6,7,3,8,9,1,10,4,11,12,13,14,2,15,5,16,17,6,18,19,7,20,
%T 3,21,22,23,8,24,25,26,9,27,1,28,29,10,30,4,31,32,11,33,34,12,35,36,
%U 13,37,38,14,39,40,2,41,42,43,15,44,45,46,5,16,47,48,17
%N The fractal sequence associated with A125153.
%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 A125153 that contains n.
%e 1 is in row 1 of A125153; 2 in row 2; 3 in row 3;
%e 4 in row 1; 5 in row 4; 6 in row 2, so the fractal
%e sequence starts with 1,2,3,1,4,2
%Y Cf. A125153.
%K nonn
%O 1,2
%A _Clark Kimberling_, Nov 21 2006
|
