%I A019471
%S A019471 2,4,7,13,21,37
%N A019471 Maximum number of states needed to accept an n-th order approximation 
               to a language over (0+1)^*, n=1..infinity; ranges of next terms are 
               [ 68,69 ], [ 128,133 ],[ 247,255 ],[ 378,383 ].
%D A019471 J. Shallit and Y. Breitbart, Automaticity I: Properties of a measure 
               of descriptional complexity, J. Comput. Sys. Sci. 53 (1996), 10-25 
               (esp. p. 19).
%Y A019471 Sequence in context: A026625 A026691 A018150 this_sequence A061257 A061255 
               A088111
%Y A019471 Adjacent sequences: A019468 A019469 A019470 this_sequence A019472 A019473 
               A019474
%K A019471 nonn
%O A019471 0,1
%A A019471 Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca)