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.

A213275 Number A(n,k) of words w where each letter of the k-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; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 1
9 1
10 1
11 6
12 3
13 1
14 1
15 1
16 24
17 15
18 7
19 1
20 1
21 1
22 120
23 105
24 106
25 19
26 1
27 1
28 1
29 720
30 945
31 2575
32 1075
33 56
34 1
35 1
36 1
37 5040
38 10395
39 87595
40 115955
41 13326
42 174
43 1
44 1
45 1
46 40320
47 135135
48 3864040
49 19558470
50 7364321
51 188196
52 561
53 1
54 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 3, 1, 1, 1, 24, 15, 7, 1, 1, 1, 120, 105, 106, 19, 1, 1, 1, 720, 945, 2575, 1075, 56, 1, 1, 1, 5040, 10395, 87595, 115955, 13326, 174, 1, 1, 1, 40320, 135135, 3864040, 19558470, 7364321, 188196, 561, 1, 1]