A321039 - cp's OEIS frontend

A321039 Number of words of length 3n such that all letters of the nonary 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)
9	246675
10	52676325
11	6567205788
12	627427976340
13	51015901999920
14	3724987212716133
15	252083271295845990
16	16134288197281838562
17	990146359650754095405
18	58830559749207291469515
19	3408249740757631887365820
20	193544431133535679583811150
21	10816879949695374764949152976

[246675, 52676325, 6567205788, 627427976340, 51015901999920, 3724987212716133, 252083271295845990, 16134288197281838562, 990146359650754095405, 58830559749207291469515, 3408249740757631887365820, 193544431133535679583811150, 10816879949695374764949152976]

cp's OEIS Frontend

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