A196231 - cp's OEIS frontend

A196231 Irregular triangle T(n,k), n>=1, 1<=k<=ceiling(n/2), read by rows: T(n,k) is the number of different ways to select k disjoint (nonempty) subsets from {1..n} with equal element sum.

n	a(n)
1	1
2	3
3	7
4	1
5	15
6	3
7	31
8	7
9	1
10	63
11	17
12	3
13	127
14	43
15	8
16	1
17	255
18	108
19	22
20	3
21	511
22	273
23	63
24	9
25	1
26	1023
27	708
28	157
29	23
30	3
31	2047
32	1867
33	502
34	67
35	10
36	1
37	4095
38	4955
39	1562
40	203
41	26
42	3
43	8191
44	13256
45	4688
46	693
47	83
48	11
49	1
50	16383
51	35790
52	15533
53	2584
54	322
55	30
56	3
57	32767
58	97340

[1, 3, 7, 1, 15, 3, 31, 7, 1, 63, 17, 3, 127, 43, 8, 1, 255, 108, 22, 3, 511, 273, 63, 9, 1, 1023, 708, 157, 23, 3, 2047, 1867, 502, 67, 10, 1, 4095, 4955, 1562, 203, 26, 3, 8191, 13256, 4688, 693, 83, 11, 1, 16383, 35790, 15533, 2584, 322, 30, 3, 32767, 97340]

cp's OEIS Frontend

A196231 Irregular triangle T(n,k), n>=1, 1<=k<=ceiling(n/2), read by rows: T(n,k) is the number of different ways to select k disjoint (nonempty) subsets from {1..n} with equal element sum.

Table of values

List of values