A213290 - cp's OEIS frontend

A213290 Number of n-length words w over binary 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.

n	a(n)
0	1
1	2
2	4
3	5
4	9
5	14
6	27
7	46
8	91
9	162
10	323
11	589
12	1177
13	2179
14	4357
15	8152
16	16303
17	30746
18	61491
19	116689
20	233377
21	445095
22	890189
23	1704795
24	3409589
25	6552379
26	13104757
27	25258601
28	50517201
29	97617061
30	195234121
31	378098956
32	756197911
33	1467343306
34	2934686611
35	5704370761

[1, 2, 4, 5, 9, 14, 27, 46, 91, 162, 323, 589, 1177, 2179, 4357, 8152, 16303, 30746, 61491, 116689, 233377, 445095, 890189, 1704795, 3409589, 6552379, 13104757, 25258601, 50517201, 97617061, 195234121, 378098956, 756197911, 1467343306, 2934686611, 5704370761]

cp's OEIS Frontend

A213290 Number of n-length words w over binary 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

List of values