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.

A060990 Number of solutions to x - d(x) = n, where d(n) is the number of divisors of n (A000005).

Table of values

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

List of values

[2, 2, 1, 1, 1, 1, 3, 0, 0, 1, 1, 3, 1, 0, 1, 1, 1, 2, 1, 0, 0, 1, 4, 1, 0, 0, 1, 2, 0, 2, 1, 1, 1, 0, 2, 2, 0, 0, 2, 2, 0, 1, 1, 0, 1, 1, 3, 1, 2, 0, 0, 2, 0, 1, 1, 0, 0, 3, 2, 1, 1, 1, 2, 0, 0, 2, 0, 0, 0, 2, 4, 1, 1, 1, 0, 0, 1, 1, 2, 0, 1, 2, 1, 1, 1, 0, 1, 2, 0, 1, 1, 2, 1, 1, 1, 1, 2, 1, 0, 1, 0, 1, 3, 0, 1, 1]