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.

A294129 Numbers n for which exactly one length minimal language exists having exactly n nonempty words over a countably infinite 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)
1 0
2 1
3 3
4 7
5 17
6 43
7 119
8 351
9 1115
10 3735
11 13231
12 48927
13 189079
14 757583
15 3148063
16 13497599
17 59704335
18 271503647
19 1268817471
20 6078518911
21 29837183007
22 149789875903
23 768674514815
24 4026518397439
25 21518708975039
26 117199152735615
27 650184360936191
28 3670861106911743

List of values

[0, 1, 3, 7, 17, 43, 119, 351, 1115, 3735, 13231, 48927, 189079, 757583, 3148063, 13497599, 59704335, 271503647, 1268817471, 6078518911, 29837183007, 149789875903, 768674514815, 4026518397439, 21518708975039, 117199152735615, 650184360936191, 3670861106911743]