A321036 - cp's OEIS frontend

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

n	a(n)
6	1428
7	122094
8	6577494
9	288152280
10	11263151718
11	410775452736
12	14329297278912
13	485304167135463
14	16110681501126303
15	527563895500327686
16	17115058041339933282
17	551744934193726332360
18	17712851478876415128930
19	567151641983253355425936
20	18132410018268844312487352

[1428, 122094, 6577494, 288152280, 11263151718, 410775452736, 14329297278912, 485304167135463, 16110681501126303, 527563895500327686, 17115058041339933282, 551744934193726332360, 17712851478876415128930, 567151641983253355425936, 18132410018268844312487352]

cp's OEIS Frontend

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

Table of values

List of values