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.

A213291 Number of n-length words w over ternary 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 3
2 9
3 18
4 36
5 74
6 165
7 367
8 869
9 2074
10 5168
11 13026
12 33749
13 88368
14 235389
15 632324
16 1717202
17 4693604
18 12921864
19 35751336
20 99416633
21 277527448
22 777659128
23 2185854247
24 6162168724
25 17416305904
26 49342480077
27 140094014788
28 398558682310
29 1135962971848

List of values

[1, 3, 9, 18, 36, 74, 165, 367, 869, 2074, 5168, 13026, 33749, 88368, 235389, 632324, 1717202, 4693604, 12921864, 35751336, 99416633, 277527448, 777659128, 2185854247, 6162168724, 17416305904, 49342480077, 140094014788, 398558682310, 1135962971848]