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.

A369384 The smallest number k that can be partitioned in n ways as the sum of two numbers from A020487.

Table of values

n a(n)
0 1
1 2
2 29
3 181
4 442
5 425
6 850
7 1300
8 2600
9 3250
10 5525
11 11050
12 17425
13 16900
14 44100
15 18850
16 72250
17 44200
18 122525
19 75400
20 55250
21 110500
22 237250
23 188500
24 266500
25 397800
26 375700
27 377000
28 187850
29 221000
30 469625
31 718250
32 640900
33 1105000
34 1812200
35 2340900
36 751400
37 3591250

List of values

[1, 2, 29, 181, 442, 425, 850, 1300, 2600, 3250, 5525, 11050, 17425, 16900, 44100, 18850, 72250, 44200, 122525, 75400, 55250, 110500, 237250, 188500, 266500, 397800, 375700, 377000, 187850, 221000, 469625, 718250, 640900, 1105000, 1812200, 2340900, 751400, 3591250]