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.

A293739 Number of multisets of nonempty words with a total of n letters over nonary alphabet 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, 1, 3, 7, 20, 54, 164, 500, 1630, 5472, 19256, 70121, 265723, 1041184, 4225484, 17689505, 76392933, 339283021, 1548592471, 7246210567, 34725853445, 170096822940, 850715642495, 4337263437693, 22519434992230, 118916581795167, 638088881489144, 3475474084479428
Offset: 0

Views

Author

Alois P. Heinz, Oct 15 2017

Keywords

Comments

This sequence differs from A293110 first at n=10.

Crossrefs

Column k=9 of A293108.

Formula

G.f.: Product_{j>=1} 1/(1-x^j)^A212915(j).
a(n) ~ c * 9^n / n^18, where c = 978644175524508179.918397627321774... - Vaclav Kotesovec, Dec 19 2020