|
| |
|
|
A074030
|
|
Number of binary Lyndon words of length n with trace 1 and subtrace 1 over Z_2.
|
|
7
| |
|
|
0, 0, 0, 1, 2, 3, 5, 8, 13, 24, 45, 85, 160, 297, 550, 1024, 1920, 3626, 6885, 13107, 24989, 47709, 91225, 174760, 335462, 645120, 1242600, 2396745, 4628480, 8948385, 17318945, 33554432
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,5
|
|
|
COMMENTS
| Same as the number of binary Lyndon words of length n with trace 1 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) = A042981(2n), a(2n+1) = A042982(2n+1). This follows from Cattell et al. (see A042979), Main Theorem on p. 33 and Theorem 4 on p. 44.
|
|
|
CROSSREFS
| Cf. A074027, A074028, A074029.
Sequence in context: A068202 A096796 A125730 * A024318 A132915 A030036
Adjacent sequences: A074027 A074028 A074029 * A074031 A074032 A074033
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Frank Ruskey, Nate Kube (ruskey(AT)cs.uvic.ca), Aug 21 2002
|
|
|
EXTENSIONS
| Corrected by Franklin T. Adams-Watters, Oct 25 2006
|
| |
|
|
