| Many classes of linear and cyclic binary strings are counted using a particularly elementary counting technique. Most of these enumerations are much simpler and more elementary than those found in the literature. Applications of these counts to other combinatorial problems are described. An apparently new identity for Lucas numbers is established; it shows how to express an arbitrary product of Lucas numbers as a sum of Lucas numbers. |
