A246750 - cp's OEIS frontend

A246750 a(n) is the smallest number k that can be partitioned into a set of n distinct integers {e(1), e(2), ..., e(n)} where all e(i) >= 2 and the sum of e(i)(e(i)-1) for i = 1 to n equals k(k-1)/2.

n	a(n)
2	9
3	28
4	41
5	65
6	85
7	96
8	149
9	176
10	200
11	244
12	281
13	332
14	389
15	400
16	497
17	565
18	609
19	657
20	745
21	833
22	884
23	989
24	1060
25	1132
26	1217
27	1312
28	1441
29	1536
30	1621
31	1740
32	1832
33	1961
34	2080
35	2189
36	2308
37	2424
38	2533
39	2669
40	2832
41	2948
42	3128
43	3244
44	3441
45	3557
46	3717
47	3901
48	4064
49	4204
50	4408

[9, 28, 41, 65, 85, 96, 149, 176, 200, 244, 281, 332, 389, 400, 497, 565, 609, 657, 745, 833, 884, 989, 1060, 1132, 1217, 1312, 1441, 1536, 1621, 1740, 1832, 1961, 2080, 2189, 2308, 2424, 2533, 2669, 2832, 2948, 3128, 3244, 3441, 3557, 3717, 3901, 4064, 4204, 4408]

cp's OEIS Frontend

A246750 a(n) is the smallest number k that can be partitioned into a set of n distinct integers {e(1), e(2), ..., e(n)} where all e(i) >= 2 and the sum of e(i)(e(i)-1) for i = 1 to n equals k(k-1)/2.

Table of values

List of values

cp's OEIS Frontend

A246750 a(n) is the smallest number k that can be partitioned into a set of n distinct integers {e(1), e(2), ..., e(n)} where all e(i) >= 2 and the sum of e(i)*(e(i)-1) for i = 1 to n equals k*(k-1)/2.

Table of values

List of values

A246750 a(n) is the smallest number k that can be partitioned into a set of n distinct integers {e(1), e(2), ..., e(n)} where all e(i) >= 2 and the sum of e(i)(e(i)-1) for i = 1 to n equals k(k-1)/2.