A256117 - cp's OEIS frontend

A256117 Number T(n,k) of length 2n 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 doublets 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	2
6	0
7	1
8	9
9	5
10	0
11	1
12	34
13	56
14	14
15	0
16	1
17	125
18	465
19	300
20	42
21	0
22	1
23	461
24	3509
25	4400
26	1485
27	132
28	0
29	1
30	1715
31	25571
32	55692
33	34034
34	7007
35	429
36	0
37	1
38	6434
39	184232
40	657370
41	647920
42	231868
43	32032
44	1430
45	0
46	1
47	24309
48	1325609
49	7488228
50	11187462
51	6191808
52	1447992
53	143208
54	4862

[1, 0, 1, 0, 1, 2, 0, 1, 9, 5, 0, 1, 34, 56, 14, 0, 1, 125, 465, 300, 42, 0, 1, 461, 3509, 4400, 1485, 132, 0, 1, 1715, 25571, 55692, 34034, 7007, 429, 0, 1, 6434, 184232, 657370, 647920, 231868, 32032, 1430, 0, 1, 24309, 1325609, 7488228, 11187462, 6191808, 1447992, 143208, 4862]

cp's OEIS Frontend

A256117 Number T(n,k) of length 2n 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 doublets into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values