cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A339272 a(n) is the smallest number k that can be partitioned into a set of n 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

n a(n)
2 4
3 13
4 17
5 40
6 24
7 21
8 44
9 41
10 41
11 57
12 48
13 48
14 68
15 65
16 65
17 81
18 85
19 72
20 72
21 85
22 89
23 89
24 105
25 109
26 109
27 96
28 116
29 133
30 113
31 113
32 133
33 133
34 140
35 140
36 120
37 157
38 153
39 137
40 157
41 164
42 164
43 164
44 181
45 181
46 181
47 181
48 188
49 188
50 201
51 188
52 205
53 205
54 225
55 212
56 205
57 212
58 212
59 229
60 229
61 229
62 229
63 249
64 249
65 256
66 236
67 236
68 253
69 253
70 253

List of values

[4, 13, 17, 40, 24, 21, 44, 41, 41, 57, 48, 48, 68, 65, 65, 81, 85, 72, 72, 85, 89, 89, 105, 109, 109, 96, 116, 133, 113, 113, 133, 133, 140, 140, 120, 157, 153, 137, 157, 164, 164, 164, 181, 181, 181, 181, 188, 188, 201, 188, 205, 205, 225, 212, 205, 212, 212, 229, 229, 229, 229, 249, 249, 256, 236, 236, 253, 253, 253]