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.

A293805 Number of multisets of nonempty words with a total of n letters over denary alphabet containing the tenth 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, 11, 122, 1003, 8072, 58393, 415813, 2822727, 18990467, 124845136, 817467196, 5294723066, 34272624834, 220905232624, 1426144152942, 9203001308101, 59568878313749, 386275420910370, 2514732764176094, 16423245577572038, 107740652646320926, 709605496053325546
Offset: 10

Views

Author

Alois P. Heinz, Oct 16 2017

Keywords

Crossrefs

Column k=10 of A293109.

Formula

a(n) = A293740(n) - A293739(n).