%I A133418
%S A133418 0,2,2,1,0,0,2,1,1,0,2,3,3,2,2,2,2,1,2,2,3,1,1,4,3,3,1,4,4,3,3,1,1,4,3,
%T A133418 3,1,4,4,3,1,2,2,3,1,1,2,3,3,1,1,2,2,3,1,1,2,3,3,1,1,2,2,3,1,1,2,3,3,1,
%U A133418 2,3,3,4,4,4,3,4,4,4,3,1,1,4,3,3,1,4,4,3,3,1,1,4,3,3,1,4,4,3,4,3,3,3,3
%N A133418 Let l(n) = number of letters in n, A005589(n). If l(n) = 4 set a(n) = 
               0; otherwise a(n) = a(l(n)) + 1.
%C A133418 Based on the observation by Diane Karloff (see A005589) that the trajectory 
               of l always converges to 4.
%H A133418 R. J. Mathar, <a href="b133418.txt">Table of n, a(n) for n = 0..11999</
               a>
%H A133418 R. J. Mathar, <a href="a133418.txt">Maple program to make b-file</a>
%e A133418 5 has four letters so a(5) = 0. 3 has five letters so a(3) = a(5) + 1 
               = 1.
%Y A133418 A variant of A016037.
%Y A133418 Sequence in context: A051168 A163528 A160806 this_sequence A029390 A108040 
               A137566
%Y A133418 Adjacent sequences: A133415 A133416 A133417 this_sequence A133419 A133420 
               A133421
%K A133418 nonn,word,easy
%O A133418 0,2
%A A133418 N. J. A. Sloane (njas(AT)research.att.com), Nov 27 2007