|
| |
|
|
A074029
|
|
Number of binary Lyndon words of length n with trace 1 and subtrace 0 over Z_2.
|
|
7
|
|
|
|
1, 1, 1, 1, 1, 2, 4, 8, 15, 27, 48, 85, 155, 288, 541, 1024, 1935, 3654, 6912, 13107, 24940, 47616, 91136, 174760, 335626, 645435, 1242904, 2396745, 4627915, 8947294, 17317888, 33554432, 65076240, 126324495, 245428574, 477218560, 928638035, 1808400384, 3524068955
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,6
|
|
|
COMMENTS
|
Same as the number of binary Lyndon words of length n with trace 1 and subtrace 0 over GF(2).
|
|
|
LINKS
|
|
|
|
FORMULA
|
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.
|
|
|
EXAMPLE
|
a(3;1,0)=1 since the one binary Lyndon word of trace 1, subtrace 0 and length 3 is ( 001 }.
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
