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.

A213878 Number of words w where each letter of the 8-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, 40320, 2027025, 13681123135, 551211090935595, 64157120593526429971, 15388200323143520006870562, 6273648300104128965616586081511, 3847028733161627562733350467148495403, 3264601141014490309682718148875987514642243
Offset: 0

Views

Author

Alois P. Heinz, Jun 23 2012

Keywords

Examples

			a(0) = 1: the empty word.
a(1) = 40320: abcdefgh, abcdefhg, abcdegfh, ..., hgfedbca, hgfedcab, hgfedcba, (all permutations of 8 letters).
		

Crossrefs

Column k=8 of A213275.