A319501 - cp's OEIS frontend

A319501 Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the set; 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	3
6	0
7	2
8	12
9	13
10	0
11	2
12	38
13	105
14	73
15	0
16	3
17	110
18	588
19	976
20	501
21	0
22	4
23	302
24	2811
25	8416
26	9945
27	4051
28	0
29	5
30	806
31	12354
32	59488
33	121710
34	111396
35	37633
36	0
37	6
38	2109
39	51543
40	375698
41	1185360
42	1830822
43	1366057
44	394353
45	0
46	8
47	5450
48	207846
49	2209276
50	10096795
51	23420022
52	28969248
53	18235680
54	4596553

[1, 0, 1, 0, 1, 3, 0, 2, 12, 13, 0, 2, 38, 105, 73, 0, 3, 110, 588, 976, 501, 0, 4, 302, 2811, 8416, 9945, 4051, 0, 5, 806, 12354, 59488, 121710, 111396, 37633, 0, 6, 2109, 51543, 375698, 1185360, 1830822, 1366057, 394353, 0, 8, 5450, 207846, 2209276, 10096795, 23420022, 28969248, 18235680, 4596553]

cp's OEIS Frontend

A319501 Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the set; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values