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.

A258258 Least number k having exactly n representations as a sum of the minimal number of triangular numbers, A000217.

Table of values

n a(n)
1 1
2 16
3 40
4 75
5 52
6 82
7 166
8 178
9 147
10 217
11 334
12 247
13 481
14 634
15 457
16 516
17 921
18 646
19 1047
20 1132
21 822
22 787
23 2110
24 1351
25 1537
26 1542
27 1402
28 1192
29 1666
30 1696
31 2137
32 1759
33 1876
34 2271
35 1792
36 2712
37 2587
38 3216
39 3909
40 2782
41 3007
42 2956
43 4242
44 3397
45 3682
46 4039
47 3607
48 3601

List of values

[1, 16, 40, 75, 52, 82, 166, 178, 147, 217, 334, 247, 481, 634, 457, 516, 921, 646, 1047, 1132, 822, 787, 2110, 1351, 1537, 1542, 1402, 1192, 1666, 1696, 2137, 1759, 1876, 2271, 1792, 2712, 2587, 3216, 3909, 2782, 3007, 2956, 4242, 3397, 3682, 4039, 3607, 3601]