A321032 - cp's OEIS frontend

A321032 Number of words of length 3n such that all letters of the binary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples into the initially empty word.

n	a(n)
2	3
3	18
4	97
5	530
6	2973
7	17059
8	99657
9	590562
10	3540463
11	21430266
12	130771375
13	803538099
14	4967127735
15	30866224823
16	192696614729
17	1207967820098
18	7600482116931
19	47981452358200
20	303820299643137
21	1929099000980218
22	12279621792772821
23	78346444891033855

[3, 18, 97, 530, 2973, 17059, 99657, 590562, 3540463, 21430266, 130771375, 803538099, 4967127735, 30866224823, 192696614729, 1207967820098, 7600482116931, 47981452358200, 303820299643137, 1929099000980218, 12279621792772821, 78346444891033855]

cp's OEIS Frontend

A321032 Number of words of length 3n such that all letters of the binary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples into the initially empty word.

Table of values

List of values