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.

A276715 a(n) = the smallest number k such that k and k + n have the same number and sum of divisors (A000005 and A000203).

Table of values

n a(n)
0 1
1 14
2 33
3 42677635
4 51
5 46
6 155
7 62
8 69
9 46
10 174
11 154
12 285
13 182
14 141
15 62
16 138
17 142
18 235
19 158
20 123
21 94
22 213
23 322
24 295
25 94
26 177
27 118
28 159
29 406
30 376
31 266
32 177
33 891528365
34 321
35 310
36 355
37 248
38 249
39 166
40 213
41 418
42 376
43 602
44 426
45 142
46 570
47 310
48 445
49 248
50 249
51 158

List of values

[1, 14, 33, 42677635, 51, 46, 155, 62, 69, 46, 174, 154, 285, 182, 141, 62, 138, 142, 235, 158, 123, 94, 213, 322, 295, 94, 177, 118, 159, 406, 376, 266, 177, 891528365, 321, 310, 355, 248, 249, 166, 213, 418, 376, 602, 426, 142, 570, 310, 445, 248, 249, 158]