A293113 - cp's OEIS frontend

A293113 Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet containing the k-th letter 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, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	2
8	3
9	1
10	0
11	2
12	8
13	4
14	1
15	0
16	3
17	20
18	16
19	5
20	1
21	0
22	4
23	47
24	53
25	25
26	6
27	1
28	0
29	5
30	106
31	173
32	102
33	36
34	7
35	1
36	0
37	6
38	237
39	532
40	410
41	172
42	49
43	8
44	1
45	0
46	8
47	522
48	1615
49	1545
50	813
51	268
52	64
53	9
54	1
55	0
56	10
57	1146
58	4785
59	5784
60	3576
61	1448
62	394
63	81
64	10
65	1

[1, 0, 1, 0, 1, 1, 0, 2, 3, 1, 0, 2, 8, 4, 1, 0, 3, 20, 16, 5, 1, 0, 4, 47, 53, 25, 6, 1, 0, 5, 106, 173, 102, 36, 7, 1, 0, 6, 237, 532, 410, 172, 49, 8, 1, 0, 8, 522, 1615, 1545, 813, 268, 64, 9, 1, 0, 10, 1146, 4785, 5784, 3576, 1448, 394, 81, 10, 1]

cp's OEIS Frontend

A293113 Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet containing the k-th letter 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, 0<=k<=n, read by rows.

Table of values

List of values