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.

A213294 Number of n-length words w over 6-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 6
2 36
3 171
4 711
5 2506
6 8151
7 25781
8 83728
9 273248
10 916966
11 3121506
12 10934875
13 38945256
14 142403783
15 529393936
16 2014819829
17 7790840332
18 30758499541
19 123255094820
20 503078455794
21 2081817569353
22 8756613613322
23 37300624224737
24 161213532001916
25 704851308055768

List of values

[1, 6, 36, 171, 711, 2506, 8151, 25781, 83728, 273248, 916966, 3121506, 10934875, 38945256, 142403783, 529393936, 2014819829, 7790840332, 30758499541, 123255094820, 503078455794, 2081817569353, 8756613613322, 37300624224737, 161213532001916, 704851308055768]