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.

A213874 Number of words w where each letter of the 4-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.

Table of values

n a(n)
0 1
1 24
2 105
3 2575
4 115955
5 7364321
6 586368681
7 54862627919
8 5795673908453
9 673174876488400
10 84386541996407430
11 11262879538848476760
12 1584243362361105791448
13 233004893382083549345048
14 35610340402841609968092950
15 5627093485549459958456588775

List of values

[1, 24, 105, 2575, 115955, 7364321, 586368681, 54862627919, 5795673908453, 673174876488400, 84386541996407430, 11262879538848476760, 1584243362361105791448, 233004893382083549345048, 35610340402841609968092950, 5627093485549459958456588775]