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.

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

Table of values

n a(n)
1 10
2 19
3 37
4 52
5 82
6 109
7 136
8 241
9 226
10 217
11 247
12 364
13 427
14 457
15 541
16 532
17 577
18 637
19 961
20 721
21 787
22 1066
23 1102
24 1381
25 1267
26 1564
27 1192
28 1396
29 1816
30 1501
31 1612
32 1927
33 1942
34 2242
35 1792
36 2842
37 2587
38 2557
39 2422
40 2866
41 2887
42 3181
43 3271
44 3412
45 4126

List of values

[10, 19, 37, 52, 82, 109, 136, 241, 226, 217, 247, 364, 427, 457, 541, 532, 577, 637, 961, 721, 787, 1066, 1102, 1381, 1267, 1564, 1192, 1396, 1816, 1501, 1612, 1927, 1942, 2242, 1792, 2842, 2587, 2557, 2422, 2866, 2887, 3181, 3271, 3412, 4126]