A256311 - cp's OEIS frontend

A256311 Number T(n,k) of length 3n words such that all letters of the k-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; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	3
6	0
7	1
8	18
9	12
10	0
11	1
12	97
13	198
14	55
15	0
16	1
17	530
18	2520
19	1820
20	273
21	0
22	1
23	2973
24	29886
25	42228
26	15300
27	1428
28	0
29	1
30	17059
31	347907
32	859180
33	564585
34	122094
35	7752
36	0
37	1
38	99657
39	4048966
40	16482191
41	17493938
42	6577494
43	942172
44	43263

[1, 0, 1, 0, 1, 3, 0, 1, 18, 12, 0, 1, 97, 198, 55, 0, 1, 530, 2520, 1820, 273, 0, 1, 2973, 29886, 42228, 15300, 1428, 0, 1, 17059, 347907, 859180, 564585, 122094, 7752, 0, 1, 99657, 4048966, 16482191, 17493938, 6577494, 942172, 43263]

cp's OEIS Frontend

A256311 Number T(n,k) of length 3n words such that all letters of the k-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; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values