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.

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

Table of values

n a(n)
1 1
2 16
3 37
4 64
5 83
6 128
7 177
8 204
9 270
10 352
11 430
12 533
13 632
14 764
15 893
16 1102
17 1256
18 1443
19 1630
20 1855
21 2141
22 2384
23 2699
24 3053
25 3378
26 3753
27 4176
28 4620
29 5068
30 5570
31 6107
32 6654
33 7253
34 7904
35 8526
36 9241
37 9975
38 10699
39 11533
40 12401
41 13301
42 14189
43 15179
44 16233
45 17286
46 18412

List of values

[1, 16, 37, 64, 83, 128, 177, 204, 270, 352, 430, 533, 632, 764, 893, 1102, 1256, 1443, 1630, 1855, 2141, 2384, 2699, 3053, 3378, 3753, 4176, 4620, 5068, 5570, 6107, 6654, 7253, 7904, 8526, 9241, 9975, 10699, 11533, 12401, 13301, 14189, 15179, 16233, 17286, 18412]