A321035 - cp's OEIS frontend

A321035 Number of words of length 3n such that all letters of the quinary 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)
5	273
6	15300
7	564585
8	17493938
9	495445275
10	13337746758
11	348484836788
12	8943435290790
13	227093583305420
14	5731575551864799
15	144208756776131553
16	3624029726937528334
17	91079326041351533935
18	2291027079046386970458
19	57709725323735510918970
20	1456179679670608615334480

[273, 15300, 564585, 17493938, 495445275, 13337746758, 348484836788, 8943435290790, 227093583305420, 5731575551864799, 144208756776131553, 3624029726937528334, 91079326041351533935, 2291027079046386970458, 57709725323735510918970, 1456179679670608615334480]

cp's OEIS Frontend

A321035 Number of words of length 3n such that all letters of the quinary 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