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.

A262512 Sequence gives the unique x for each term of A262511 which contains those numbers n that have exactly one solution to x - d(x) = n, where d(n) is the number of divisors of n (A000005).

Table of values

n a(n)
1 6
2 5
3 8
4 7
5 11
6 14
7 18
8 20
9 17
10 24
11 22
12 23
13 27
14 32
15 34
16 35
17 40
18 43
19 46
20 50
21 47
22 51
23 57
24 58
25 61
26 72
27 65
28 73
29 84
30 77
31 81
32 79
33 88
34 86
35 87
36 96
37 92
38 93
39 94
40 98
41 99
42 102
43 97
44 105
45 101
46 103
47 120
48 107
49 114
50 116
51 119
52 123
53 125
54 130
55 135
56 137
57 143
58 154
59 160
60 151
61 155
62 158
63 164
64 163
65 175
66 173
67 177
68 184
69 179
70 187
71 198
72 200
73 191
74 194
75 193
76 204
77 210
78 197
79 203
80 216
81 206
82 209
83 212

List of values

[6, 5, 8, 7, 11, 14, 18, 20, 17, 24, 22, 23, 27, 32, 34, 35, 40, 43, 46, 50, 47, 51, 57, 58, 61, 72, 65, 73, 84, 77, 81, 79, 88, 86, 87, 96, 92, 93, 94, 98, 99, 102, 97, 105, 101, 103, 120, 107, 114, 116, 119, 123, 125, 130, 135, 137, 143, 154, 160, 151, 155, 158, 164, 163, 175, 173, 177, 184, 179, 187, 198, 200, 191, 194, 193, 204, 210, 197, 203, 216, 206, 209, 212]