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.

A321838 Number of words w of length n such that each letter of the binary alphabet is used at least once and 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)
2 2
3 3
4 7
5 12
6 25
7 44
8 89
9 160
10 321
11 587
12 1175
13 2177
14 4355
15 8150
16 16301
17 30744
18 61489
19 116687
20 233375
21 445093
22 890187
23 1704793
24 3409587
25 6552377
26 13104755
27 25258599
28 50517199
29 97617059
30 195234119
31 378098954
32 756197909
33 1467343304
34 2934686609
35 5704370759

List of values

[2, 3, 7, 12, 25, 44, 89, 160, 321, 587, 1175, 2177, 4355, 8150, 16301, 30744, 61489, 116687, 233375, 445093, 890187, 1704793, 3409587, 6552377, 13104755, 25258599, 50517199, 97617059, 195234119, 378098954, 756197909, 1467343304, 2934686609, 5704370759]