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.

A266110 If A082284(n) = 0, a(n) = 0, otherwise a(n) = 1 + a(A082284(n)), where A082284(n) = smallest number k such that k - d(k) = n, or 0 if no such number exists, and d(n) = the number of divisors of n (A000005).

Table of values

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

List of values

[4, 3, 4, 2, 1, 1, 3, 0, 0, 2, 2, 1, 3, 0, 1, 2, 1, 1, 2, 0, 0, 6, 1, 5, 0, 0, 2, 4, 0, 3, 4, 2, 1, 0, 3, 1, 0, 0, 2, 2, 0, 1, 2, 0, 1, 8, 1, 7, 1, 0, 0, 6, 0, 5, 3, 0, 0, 4, 2, 3, 7, 2, 1, 0, 0, 1, 0, 0, 0, 4, 1, 3, 6, 2, 0, 0, 8, 1, 4, 0, 1, 7, 3, 6, 5, 0, 2, 5, 0, 4, 12, 5, 1, 3, 11, 4, 4, 3, 0, 2, 0, 1, 10, 0, 3, 2, 9, 1, 0, 0, 1, 1, 0, 0, 8, 2, 0, 0, 7, 1, 2, 6]