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.

A213283 Number of 4-length words w over 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 0
1 1
2 9
3 36
4 118
5 315
6 711
7 1414
8 2556
9 4293
10 6805
11 10296
12 14994
13 21151
14 29043
15 38970
16 51256
17 66249
18 84321
19 105868
20 131310
21 161091
22 195679
23 235566
24 281268
25 333325
26 392301
27 458784
28 533386
29 616743
30 709515
31 812386
32 926064
33 1051281
34 1188793
35 1339380
36 1503846

List of values

[0, 1, 9, 36, 118, 315, 711, 1414, 2556, 4293, 6805, 10296, 14994, 21151, 29043, 38970, 51256, 66249, 84321, 105868, 131310, 161091, 195679, 235566, 281268, 333325, 392301, 458784, 533386, 616743, 709515, 812386, 926064, 1051281, 1188793, 1339380, 1503846]