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.

A213292 Number of n-length words w over 4-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 4
2 16
3 46
4 118
5 276
6 712
7 1805
8 4895
9 13280
10 37993
11 109386
12 328219
13 992413
14 3101399
15 9764376
16 31580645
17 102797899
18 342075208
19 1144125506
20 3896297053
21 13319243655
22 46206520968
23 160729837020
24 565901313043
25 1996113320841
26 7111795754941
27 25369213794266

List of values

[1, 4, 16, 46, 118, 276, 712, 1805, 4895, 13280, 37993, 109386, 328219, 992413, 3101399, 9764376, 31580645, 102797899, 342075208, 1144125506, 3896297053, 13319243655, 46206520968, 160729837020, 565901313043, 1996113320841, 7111795754941, 25369213794266]