A293815 - cp's OEIS frontend

A293815 Number T(n,k) of sets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	0
6	4
7	2
8	0
9	10
10	5
11	0
12	26
13	18
14	1
15	0
16	76
17	52
18	8
19	0
20	232
21	168
22	30
23	0
24	764
25	533
26	114
27	4
28	0
29	2620
30	1792
31	411
32	22
33	0
34	9496
35	6161
36	1462
37	116
38	0
39	35696
40	22088
41	5237
42	482
43	6
44	0
45	140152
46	81690
47	18998
48	1966
49	48
50	0
51	568504
52	313224
53	70220
54	7682
55	274

[1, 0, 1, 0, 2, 0, 4, 2, 0, 10, 5, 0, 26, 18, 1, 0, 76, 52, 8, 0, 232, 168, 30, 0, 764, 533, 114, 4, 0, 2620, 1792, 411, 22, 0, 9496, 6161, 1462, 116, 0, 35696, 22088, 5237, 482, 6, 0, 140152, 81690, 18998, 1966, 48, 0, 568504, 313224, 70220, 7682, 274]

cp's OEIS Frontend

A293815 Number T(n,k) of sets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, read by rows.

Table of values

List of values