cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A050185 T(2n+7,n), array T as in A051168; a count of Lyndon words.

Original entry on oeis.org

0, 1, 5, 22, 91, 364, 1428, 5537, 21318, 81719, 312455, 1193010, 4552275, 17368680, 66284554, 253086480, 966955410, 3697182450, 14147884842, 54185826156, 207712333598, 796937116661, 3060338457400, 11762344331920
Offset: 0

Views

Author

Keywords

Comments

Is a(n) = A000588(n+3)/7 if n is not a multiple of 7? R. J. Mathar, Jul 24 2012