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.

A213871 Number of words w where each letter of the 9-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, 362880, 34459425, 1035588754375, 256653852463806955, 224909472938181653263446, 468682891926540940991787213006, 1850042480471503379038420801262526759, 11963401430840044468894095677711389363239184, 114752550881830601773639529476205016572641397025904
Offset: 0

Views

Author

Alois P. Heinz, Jun 23 2012

Keywords

Examples

			a(0) = 1: the empty word.
a(1) = 362880: all permutations of 9 letters.
		

Crossrefs

Column k=9 of A213275.