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.

A374807 a(n) is the smallest number which can be represented as the sum of 4 distinct nonzero triangular numbers in exactly n ways, or -1 if no such number exists.

Table of values

n a(n)
1 20
2 38
3 47
4 64
5 73
6 92
7 97
8 110
9 127
10 115
11 130
12 164
13 185
14 172
15 208
16 157
17 199
18 235
19 247
20 232
21 220
22 272
23 277
24 304
25 280
26 361
27 262
28 307
29 319
30 391
31 322
32 292
33 495
34 415
35 337
36 367
37 370
38 382
39 478
40 482
41 412
42 409
43 445
44 430
45 467
46 500
47 427
48 532
49 493

List of values

[20, 38, 47, 64, 73, 92, 97, 110, 127, 115, 130, 164, 185, 172, 208, 157, 199, 235, 247, 232, 220, 272, 277, 304, 280, 361, 262, 307, 319, 391, 322, 292, 495, 415, 337, 367, 370, 382, 478, 482, 412, 409, 445, 430, 467, 500, 427, 532, 493]