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.

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

List of values

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