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.

A244409 Numbers x such that it is possible to find a value k for which Sum_{j=1..x} (x mod j) = Sum_{j=1..k} j.

Table of values

n a(n)
1 3
2 4
3 6
4 13
5 15
6 16
7 43
8 112
9 278
10 346
11 527
12 845
13 1214
14 1612
15 2189
16 2863
17 10278
18 610410
19 981350
20 2054106
21 3286515
22 3764767
23 4293562
24 5543363
25 5728393
26 20142483
27 66790186
28 67652048
29 72730730
30 137252581
31 198373964
32 338557754
33 406463074
34 687452210
35 911028356

List of values

[3, 4, 6, 13, 15, 16, 43, 112, 278, 346, 527, 845, 1214, 1612, 2189, 2863, 10278, 610410, 981350, 2054106, 3286515, 3764767, 4293562, 5543363, 5728393, 20142483, 66790186, 67652048, 72730730, 137252581, 198373964, 338557754, 406463074, 687452210, 911028356]