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.

A293734 Number of multisets of nonempty words with a total of n letters over quaternary alphabet such that within each prefix of a 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 7
4 20
5 53
6 157
7 455
8 1393
9 4270
10 13495
11 42907
12 139323
13 455182
14 1510831
15 5042858
16 17044789
17 57891598
18 198665585
19 684615958
20 2379765470
21 8302157207
22 29177909254
23 102867895209
24 364981305292
25 1298526198294
26 4645569147108
27 16659856695779
28 60036951331540

List of values

[1, 1, 3, 7, 20, 53, 157, 455, 1393, 4270, 13495, 42907, 139323, 455182, 1510831, 5042858, 17044789, 57891598, 198665585, 684615958, 2379765470, 8302157207, 29177909254, 102867895209, 364981305292, 1298526198294, 4645569147108, 16659856695779, 60036951331540]