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.

A274422 Numbers m such that there exists a j for which m = Sum_{k=1..j} (m mod k), where k runs through the largest j primes less than m.

Table of values

n a(n)
1 13
2 17
3 20
4 23
5 24
6 34
7 40
8 82
9 126
10 200
11 612
12 1154
13 1692
14 2434
15 2806
16 3060
17 3142
18 4052
19 4460
20 4596
21 5020
22 5908
23 6424
24 7304
25 7596
26 8030
27 8040
28 9044
29 11398
30 12254
31 12914
32 13412
33 13716
34 16006
35 16800
36 18560
37 22438
38 23140
39 24424
40 24746
41 25706
42 28318
43 29272
44 30580

List of values

[13, 17, 20, 23, 24, 34, 40, 82, 126, 200, 612, 1154, 1692, 2434, 2806, 3060, 3142, 4052, 4460, 4596, 5020, 5908, 6424, 7304, 7596, 8030, 8040, 9044, 11398, 12254, 12914, 13412, 13716, 16006, 16800, 18560, 22438, 23140, 24424, 24746, 25706, 28318, 29272, 30580]