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.

A321704 Number of words w of length n over an n-ary alphabet such that 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.

Table of values

n a(n)
0 1
1 1
2 4
3 18
4 118
5 895
6 8151
7 83916
8 977026
9 12602451
10 178880725
11 2766415036
12 46314488705
13 834067614601
14 16074694453741
15 330017679352180
16 7188779521480810

List of values

[1, 1, 4, 18, 118, 895, 8151, 83916, 977026, 12602451, 178880725, 2766415036, 46314488705, 834067614601, 16074694453741, 330017679352180, 7188779521480810]