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.

A213872 Number of words w where each letter of the 10-ary alphabet occurs n times and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.

Original entry on oeis.org

1, 3628800, 654729075, 89575852312675, 140633739174235040170, 961415357313559098150122721, 18131599140232990157442722880124741, 725168149513389307543056971716033431701831, 51960277212541922189750307005207837858451630919380
Offset: 0

Views

Author

Alois P. Heinz, Jun 23 2012

Keywords

Examples

			a(0) = 1: the empty word.
a(1) = 3628800: all permutations of 10 letters.
		

Crossrefs

Column k=10 of A213275.