A293808 - cp's OEIS frontend

A293808 Number T(n,k) of multisets 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, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	1
6	0
7	4
8	2
9	1
10	0
11	10
12	7
13	2
14	1
15	0
16	26
17	18
18	7
19	2
20	1
21	0
22	76
23	56
24	22
25	7
26	2
27	1
28	0
29	232
30	168
31	68
32	22
33	7
34	2
35	1
36	0
37	764
38	543
39	218
40	73
41	22
42	7
43	2
44	1
45	0
46	2620
47	1792
48	721
49	234
50	73
51	22
52	7
53	2
54	1
55	0
56	9496
57	6187
58	2438
59	791
60	240
61	73
62	22
63	7
64	2
65	1
66	0
67	35696
68	22088
69	8491
70	2702
71	811
72	240
73	73
74	22
75	7
76	2
77	1

[1, 0, 1, 0, 2, 1, 0, 4, 2, 1, 0, 10, 7, 2, 1, 0, 26, 18, 7, 2, 1, 0, 76, 56, 22, 7, 2, 1, 0, 232, 168, 68, 22, 7, 2, 1, 0, 764, 543, 218, 73, 22, 7, 2, 1, 0, 2620, 1792, 721, 234, 73, 22, 7, 2, 1, 0, 9496, 6187, 2438, 791, 240, 73, 22, 7, 2, 1, 0, 35696, 22088, 8491, 2702, 811, 240, 73, 22, 7, 2, 1]

cp's OEIS Frontend

A293808 Number T(n,k) of multisets 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, 0<=k<=n, read by rows.

Table of values

List of values