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.

A082730 a(n) = smallest number k such that k - ms(k) = n, or 0 if no such number has been found, where ms(k) = sum of divisors of k other than k.

Table of values

n a(n)
0 6
1 1
2 3
3 0
4 5
5 9
6 7
7 50
8 22
9 0
10 11
11 244036
12 13
13 0
14 27
15 0
16 17
17 0
18 19
19 25
20 46
21 0
22 23
23 0
24 124
25 98
26 58
27 0
28 29
29 0
30 31
31 0
32 250
33 0
34 57
35 0
36 37
37 484
38 55
39 0
40 41
41 49
42 43
43 0
44 94
45 0
46 47
47 225
48 1264
49 0
50 106
51 0
52 53
53 0
54 87
55 0
56 118
57 0
58 59
59 0
60 61
61 2888
62 85
63 0
64 134
65 0
66 67
67 0
68 142
69 0
70 71
71 676
72 73
73 0

List of values

[6, 1, 3, 0, 5, 9, 7, 50, 22, 0, 11, 244036, 13, 0, 27, 0, 17, 0, 19, 25, 46, 0, 23, 0, 124, 98, 58, 0, 29, 0, 31, 0, 250, 0, 57, 0, 37, 484, 55, 0, 41, 49, 43, 0, 94, 0, 47, 225, 1264, 0, 106, 0, 53, 0, 87, 0, 118, 0, 59, 0, 61, 2888, 85, 0, 134, 0, 67, 0, 142, 0, 71, 676, 73, 0]