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.

A213877 Number of words w where each letter of the 7-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, 5040, 135135, 210455470, 1428739165560, 23060727168393236, 668821362774214965294, 29745278219128813035415595, 1835364055105945091130559202709, 146812609193179942830629976945746464, 14506158303190746913523011613729321067580
Offset: 0

Views

Author

Alois P. Heinz, Jun 23 2012

Keywords

Examples

			a(0) = 1: the empty word.
a(1) = 5040: abcdefg, abcdegf, abcdfeg, ..., gfedbca, gfedcab, gfedcba, (all permutations of 7 letters).
a(2) = 135135: aabbccddeeffgg, aabbccddeefgfg, aabbccddeegffg, ..., gfedcaabbcdefg, gfedcababcdefg, gfedcbaabcdefg.
		

Crossrefs

Column k=7 of A213275.