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.

A340410 Number of sets of nonempty words with a total of n letters over ternary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

Table of values

n a(n)
0 1
1 1
2 3
3 13
4 36
5 122
6 433
7 1356
8 4449
9 15279
10 48567
11 158837
12 532415
13 1704777
14 5547148
15 18335536
16 58815602
17 190574866
18 623885902
19 2000945191
20 6459510350
21 20998728429
22 67275468661
23 216477522426
24 699952967976
25 2239210854373
26 7184690267832
27 23131348476391

List of values

[1, 1, 3, 13, 36, 122, 433, 1356, 4449, 15279, 48567, 158837, 532415, 1704777, 5547148, 18335536, 58815602, 190574866, 623885902, 2000945191, 6459510350, 20998728429, 67275468661, 216477522426, 699952967976, 2239210854373, 7184690267832, 23131348476391]