|
Search: id:A074028
|
|
|
| A074028 |
|
Number of binary Lyndon words of length n with trace 0 and subtrace 1 over Z_2. |
|
+0
4
|
|
| 0, 0, 1, 1, 2, 2, 4, 6, 13, 24, 48, 85, 160, 288, 541, 1008, 1920, 3626, 6912, 13107, 24989, 47616, 91136, 174590, 335462, 645120, 1242904, 2396745, 4628480, 8947294, 17317888, 33552384
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Same as the number of binary Lyndon words of length n with trace 0 and subtrace 1 over GF(2).
|
|
LINKS
|
F. Ruskey, Binary Lyndon words with given trace and subtrace
F. Ruskey, Binary Lyndon words with given trace and subtrace over GF(2)
|
|
FORMULA
|
a(2n) = A042980(2n), a(2n+1) = A042979(2n+1). This follows from Cattell et al. (see A042979), Main Theorem on p. 33 and Theorem 4 on p. 44.
|
|
EXAMPLE
|
a(5;0,1)=2 since the two binary Lyndon words of trace 0, subtrace 1 and length 5 are { 00011, 00101 }.
|
|
CROSSREFS
|
Cf. A074027, A074029, A074030.
Sequence in context: A128209 A052953 A153955 this_sequence A061894 A116684 A116637
Adjacent sequences: A074025 A074026 A074027 this_sequence A074029 A074030 A074031
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Frank Ruskey, Nate Kube (fruskey(AT)cs.uvic.ca), Aug 21 2002
|
|
|
Search completed in 0.002 seconds
|
