%I #5 Mar 30 2012 18:39:16
%S 1,2,1,2,2,1,1,1,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T 1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2
%N A self generating sequence: "there are n a(n)'s in the sequence". Start with 1,2 and use the rule : "a(n)=k implies there are n following k's (k is 1 or 2)".
%C Lengths of runs of consecutive 1's or 2's are : 1,1,2,3,9,21,117,588 ...
%e Sequence begins : 1,2 . Since a(1)=1 there is only one following "1", gives 1,2,1. Since a(2)=2 there are 2 following "2's", gives 1,2,1,2,2. Since a(3)=1 there are 3 following "1's" 1,2,1,2,2,1,1,1 etc.
%K nonn
%O 1,2
%A _Benoit Cloitre_, Apr 21 2003
|