A241500 - cp's OEIS frontend

A241500 Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	5
9	4
10	1
11	1
12	11
13	16
14	7
15	1
16	1
17	23
18	58
19	41
20	11
21	1
22	1
23	47
24	196
25	215
26	90
27	16
28	1
29	1
30	95
31	634
32	1041
33	640
34	176
35	22
36	1
37	1
38	191
39	1996
40	4767
41	4151
42	1631
43	315
44	29
45	1
46	1
47	383
48	6178
49	21001
50	25221
51	13587
52	3696
53	526
54	37
55	1
56	1
57	767
58	18916
59	90055
60	146140
61	105042
62	38409
63	7638
64	831
65	46
66	1

[1, 1, 1, 1, 2, 1, 1, 5, 4, 1, 1, 11, 16, 7, 1, 1, 23, 58, 41, 11, 1, 1, 47, 196, 215, 90, 16, 1, 1, 95, 634, 1041, 640, 176, 22, 1, 1, 191, 1996, 4767, 4151, 1631, 315, 29, 1, 1, 383, 6178, 21001, 25221, 13587, 3696, 526, 37, 1, 1, 767, 18916, 90055, 146140, 105042, 38409, 7638, 831, 46, 1]

cp's OEIS Frontend

A241500 Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n.

Table of values

List of values