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.

A110351 Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2.

Table of values

n a(n)
1 2
2 3
3 30
4 110
5 30
6 84
7 1148
8 1980
9 585
10 935
11 462
12 702
13 2912
14 105
15 3120
16 32504
17 9027
18 11457
19 2660
20 420
21 2772
22 26312
23 16560
24 19800
25 44525
26 52299
27 17388
28 20300
29 10005
30 11625
31 460784
32 61248
33 11220
34 2975
35 24570
36 43290
37 220742
38 29640
39 4680
40 188600

List of values

[2, 3, 30, 110, 30, 84, 1148, 1980, 585, 935, 462, 702, 2912, 105, 3120, 32504, 9027, 11457, 2660, 420, 2772, 26312, 16560, 19800, 44525, 52299, 17388, 20300, 10005, 11625, 460784, 61248, 11220, 2975, 24570, 43290, 220742, 29640, 4680, 188600]