A248112 - cp's OEIS frontend

A248112 Number T(n,k) of subsets of {1,...,n} containing n and having at least one set partition into k blocks with equal element sum; triangle T(n,k), n>=1, 1<=k<=floor((n+1)/2), read by rows.

n	a(n)
1	1
2	2
3	4
4	1
5	8
6	2
7	16
8	4
9	1
10	32
11	10
12	2
13	64
14	20
15	5
16	1
17	128
18	44
19	12
20	2
21	256
22	93
23	29
24	6
25	1
26	512
27	198
28	63
29	14
30	2
31	1024
32	414
33	146
34	37
35	7
36	1
37	2048
38	864
39	329
40	88
41	16
42	2
43	4096
44	1788
45	722
46	218
47	49
48	8
49	1
50	8192
51	3687
52	1613
53	515
54	118
55	19
56	2
57	16384
58	7541
59	3505
60	1226
61	313
62	62
63	9
64	1

[1, 2, 4, 1, 8, 2, 16, 4, 1, 32, 10, 2, 64, 20, 5, 1, 128, 44, 12, 2, 256, 93, 29, 6, 1, 512, 198, 63, 14, 2, 1024, 414, 146, 37, 7, 1, 2048, 864, 329, 88, 16, 2, 4096, 1788, 722, 218, 49, 8, 1, 8192, 3687, 1613, 515, 118, 19, 2, 16384, 7541, 3505, 1226, 313, 62, 9, 1]

cp's OEIS Frontend

A248112 Number T(n,k) of subsets of {1,...,n} containing n and having at least one set partition into k blocks with equal element sum; triangle T(n,k), n>=1, 1<=k<=floor((n+1)/2), read by rows.

Table of values

List of values