%I A112383
%S A112383 1,1,2,1,3,2,1,4,3,5,2,1,4,6,3,5,7,2,8,1,4,6,3,9,5,7,2,10,8,1,4,6,3,
%T A112383 11,9,5,12,7,13,2,10,8,1,14,4,6,3,11,9,5,15,12,7,13,16,2,10,8,1,14,
%U A112383 17,4,6,3,11,9,5,15,18,12,7,19,13,16,2,10,8,1,14,17,20,4,21,6,3,11
%N A112383 A self-descriptive fractal sequence: the sequence contains every positive 
               integer. If the first occurrence of each integer is deleted from 
               the sequence, the resulting sequence is the same is the original 
               (this process may be called "upper trimming").
%C A112383 This sequence gives the number of numbers that are retained between Xs 
               that are dropped (cf. the example in A112382). Alternatively, each 
               element is the number of numbers between two first occurrences of 
               integers. For example, the first 3 describes the three numbers 2, 
               1, 4 between the first 5 and the first 6.
%Y A112383 Cf. A112377, A112382, A112384.
%Y A112383 Sequence in context: A104325 A133084 A118851 this_sequence A133404 A134627 
               A064881
%Y A112383 Adjacent sequences: A112380 A112381 A112382 this_sequence A112384 A112385 
               A112386
%K A112383 nonn
%O A112383 0,3
%A A112383 Kerry Mitchell (lkmitch(AT)gmail.com), Dec 05 2005