A293109 - cp's OEIS frontend

A293109 Number T(n,k) of multisets 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	2
5	1
6	0
7	3
8	3
9	1
10	0
11	5
12	10
13	4
14	1
15	0
16	7
17	24
18	17
19	5
20	1
21	0
22	11
23	62
24	58
25	26
26	6
27	1
28	0
29	15
30	140
31	193
32	107
33	37
34	7
35	1
36	0
37	22
38	329
39	603
40	439
41	178
42	50
43	8
44	1
45	0
46	30
47	725
48	1852
49	1663
50	852
51	275
52	65
53	9
54	1
55	0
56	42
57	1631
58	5539
59	6283
60	3767
61	1500
62	402
63	82
64	10
65	1

[1, 0, 1, 0, 2, 1, 0, 3, 3, 1, 0, 5, 10, 4, 1, 0, 7, 24, 17, 5, 1, 0, 11, 62, 58, 26, 6, 1, 0, 15, 140, 193, 107, 37, 7, 1, 0, 22, 329, 603, 439, 178, 50, 8, 1, 0, 30, 725, 1852, 1663, 852, 275, 65, 9, 1, 0, 42, 1631, 5539, 6283, 3767, 1500, 402, 82, 10, 1]

cp's OEIS Frontend

A293109 Number T(n,k) of multisets 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