%I A074029
%S A074029 1,1,1,1,1,2,4,8,15,27,48,85,155,288,541,1024,1935,3654,6912,13107,
%T A074029 24940,47616,91136,174760,335626,645435,1242904,2396745,4627915,8947294,
%U A074029 17317888,33554432
%N A074029 Number of binary Lyndon words of length n with trace 1 and subtrace 0 
               over Z_2.
%C A074029 Same as the number of binary Lyndon words of length n with trace 1 and 
               subtrace 0 over GF(2).
%H A074029 F. Ruskey, <a href="http://www.theory.csc.uvic.ca/~cos/inf/trs/lyn/Zq/
               lyn_tr_subtr_Z2.html">Binary Lyndon words with given trace and subtrace</
               a>
%H A074029 F. Ruskey, <a href="http://www.theory.csc.uvic.ca/~cos/inf/trs/lyn/Fq/
               lyn_tr_subtr_F2.html">Binary Lyndon words with given trace and subtrace 
               over GF(2)</a>
%F A074029 a(2n) = A042982(2n), a(2n+1) = A049281(2n+1). This follows from Cattell 
               et al. (see A042979), Main Theorem on p. 33 and Theorem 4 on p. 44.
%e A074029 a(3;1,0)=1 since the one binary Lyndon word of trace 1, subtrace 0 and 
               length 3 is ( 001 }.
%Y A074029 Cf. A074027, A074028, A074030.
%Y A074029 Sequence in context: A000126 A143281 A098057 this_sequence A138653 A054159 
               A056181
%Y A074029 Adjacent sequences: A074026 A074027 A074028 this_sequence A074030 A074031 
               A074032
%K A074029 easy,nonn
%O A074029 1,6
%A A074029 Frank Ruskey, Nate Kube (fruskey(AT)cs.uvic.ca), Aug 21 2002