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.

A293883 Number of sets of nonempty words with a total of n letters over binary alphabet containing the second letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

Original entry on oeis.org

1, 3, 8, 20, 47, 106, 237, 522, 1146, 2485, 5406, 11644, 25157, 53964, 116003, 247987, 530999, 1131889, 2415431, 5135838, 10927816, 23182209, 49199697, 104154808, 220543306, 465996956, 984704338, 2076988457, 4380764354, 9225209588, 19424813915, 40844509107
Offset: 2

Views

Author

Alois P. Heinz, Oct 18 2017

Keywords

Crossrefs

Column k=2 of A293113.

Formula

a(n) = A293741(n) - A000009(n).