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.

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

List of values

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