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.

A375595 Numbers m for which the sum of all values of k satisfying the equation: m mod k = floor((m - k)/k) mod k (1 <= k <= m) exceeds 2*m.

Table of values

n a(n)
1 23
2 29
3 35
4 41
5 47
6 53
7 59
8 65
9 71
10 77
11 79
12 83
13 89
14 95
15 99
16 101
17 107
18 111
19 113
20 119
21 125
22 131
23 137
24 139
25 143
26 149
27 155
28 159
29 161
30 167
31 173
32 179
33 185
34 191
35 197
36 199
37 203
38 209
39 215
40 219
41 221
42 223
43 227
44 233
45 239
46 245
47 251
48 257
49 259
50 263
51 269

List of values

[23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 79, 83, 89, 95, 99, 101, 107, 111, 113, 119, 125, 131, 137, 139, 143, 149, 155, 159, 161, 167, 173, 179, 185, 191, 197, 199, 203, 209, 215, 219, 221, 223, 227, 233, 239, 245, 251, 257, 259, 263, 269]