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.

A286530 a(n) = d(n+d(n)) - d(n), where d(n) is the number of divisors of n (A000005).

Table of values

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

List of values

[1, 1, 0, -1, 0, 0, 1, 2, 3, 0, 0, 0, 2, 2, -2, -1, 0, 2, 2, -2, -1, 0, 1, -2, 3, 4, -2, -2, 0, -4, 2, -2, -2, 0, 0, -3, 2, 4, -2, 2, 0, -2, 4, 0, -2, 2, 1, -6, 3, 2, 0, -2, 2, -4, -2, -1, -2, 0, 0, 0, 4, 4, -2, -5, 0, -4, 2, -2, -2, 0, 0, 0, 4, 4, -1, -2, 1, -4, 3, 2, -1, 0, 2, 0, -2, 8, 0, 4, 2, -4, 0, 0, -2, 2, 2, 0, 4, 2, 2, -7, 0, 0, 6, 2, -6, 4, 0, 4, 2]