A321041 - cp's OEIS frontend

A321041 Number of words of length 6n such that all letters of the n-ary 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)
0	1
1	1
2	97
3	29886
4	16482191
5	13337746758
6	14329297278912
7	19256258184412314
8	31120996552066805175
9	58830559749207291469515
10	127426007577261157375345878
11	311250333529456439224989700168
12	846594239519776323268829614117536
13	2538054216720547203941994076323844425

[1, 1, 97, 29886, 16482191, 13337746758, 14329297278912, 19256258184412314, 31120996552066805175, 58830559749207291469515, 127426007577261157375345878, 311250333529456439224989700168, 846594239519776323268829614117536, 2538054216720547203941994076323844425]

cp's OEIS Frontend

A321041 Number of words of length 6n such that all letters of the n-ary 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