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.

A262686 a(n) = largest number k such that k - d(k) = n, or 0 if no such number exists, where d(n) = the number of divisors of n (A000005).

Table of values

n a(n)
0 2
1 4
2 6
3 5
4 8
5 7
6 12
7 0
8 0
9 11
10 14
11 16
12 18
13 0
14 20
15 17
16 24
17 21
18 22
19 0
20 0
21 23
22 30
23 27
24 0
25 0
26 32
27 36
28 0
29 33
30 34
31 35
32 40
33 0
34 42
35 39
36 0
37 0
38 48
39 45
40 0
41 43
42 46
43 0
44 50
45 47
46 54
47 51
48 60
49 0
50 0
51 55
52 0
53 57
54 58
55 0
56 0
57 64
58 66
59 61
60 72
61 65
62 70
63 0
64 0
65 69
66 0
67 0
68 0
69 75
70 80
71 73
72 84
73 77
74 0
75 0
76 81
77 79
78 90
79 0
80 88
81 85
82 86
83 87
84 96
85 0
86 92
87 91
88 0
89 93
90 94
91 100
92 98
93 99
94 102
95 97
96 108
97 105
98 0
99 101

List of values

[2, 4, 6, 5, 8, 7, 12, 0, 0, 11, 14, 16, 18, 0, 20, 17, 24, 21, 22, 0, 0, 23, 30, 27, 0, 0, 32, 36, 0, 33, 34, 35, 40, 0, 42, 39, 0, 0, 48, 45, 0, 43, 46, 0, 50, 47, 54, 51, 60, 0, 0, 55, 0, 57, 58, 0, 0, 64, 66, 61, 72, 65, 70, 0, 0, 69, 0, 0, 0, 75, 80, 73, 84, 77, 0, 0, 81, 79, 90, 0, 88, 85, 86, 87, 96, 0, 92, 91, 0, 93, 94, 100, 98, 99, 102, 97, 108, 105, 0, 101]