A339271 - cp's OEIS frontend

A339271 a(n) is the smallest number k that can be partitioned into a set of n distinct positive integers {e(1), e(2), ..., e(n)} where Sum_{i=1..n} e(i)(e(i)-1) = k(k-1)/2.

n	a(n)
2	4
3	13
4	20
5	53
6	56
7	92
8	109
9	120
10	160
11	200
12	221
13	268
14	325
15	389
16	420
17	497
18	561
19	616
20	684
21	725
22	813
23	901
24	969
25	1064
26	1132
27	1197
28	1329
29	1421
30	1516
31	1581
32	1740
33	1849
34	1904
35	2060
36	2189
37	2288
38	2444
39	2560
40	2696
41	2849
42	2985
43	3128
44	3261
45	3404
46	3564
47	3744
48	3904
49	4044
50	4204
51	4381
52	4585
53	4725

[4, 13, 20, 53, 56, 92, 109, 120, 160, 200, 221, 268, 325, 389, 420, 497, 561, 616, 684, 725, 813, 901, 969, 1064, 1132, 1197, 1329, 1421, 1516, 1581, 1740, 1849, 1904, 2060, 2189, 2288, 2444, 2560, 2696, 2849, 2985, 3128, 3261, 3404, 3564, 3744, 3904, 4044, 4204, 4381, 4585, 4725]

cp's OEIS Frontend

A339271 a(n) is the smallest number k that can be partitioned into a set of n distinct positive integers {e(1), e(2), ..., e(n)} where Sum_{i=1..n} e(i)(e(i)-1) = k(k-1)/2.

Table of values

List of values

cp's OEIS Frontend

A339271 a(n) is the smallest number k that can be partitioned into a set of n distinct positive integers {e(1), e(2), ..., e(n)} where Sum_{i=1..n} e(i)*(e(i)-1) = k*(k-1)/2.

Table of values

List of values

A339271 a(n) is the smallest number k that can be partitioned into a set of n distinct positive integers {e(1), e(2), ..., e(n)} where Sum_{i=1..n} e(i)(e(i)-1) = k(k-1)/2.