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.

A213873 Number of words w where each letter of the ternary 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 6
2 15
3 106
4 1075
5 13326
6 188196
7 2914395
8 48349015
9 846167608
10 15456538890
11 292407484590
12 5695907466120
13 113735416237808
14 2319861446805120
15 48199341935153655
16 1017747539683821855
17 21799192392184931700
18 472889100118180757550
19 10375788309377599231200

List of values

[1, 6, 15, 106, 1075, 13326, 188196, 2914395, 48349015, 846167608, 15456538890, 292407484590, 5695907466120, 113735416237808, 2319861446805120, 48199341935153655, 1017747539683821855, 21799192392184931700, 472889100118180757550, 10375788309377599231200]