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.

A348337 For n >= 1; x = n, then iterate x --> x + d(x) until d(x + d(x)) >= d(x). a(n) gives the number of iteration steps where d(i) is the number of divisors of i, A000005(i).

Table of values

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

List of values

[3, 2, 7, 1, 6, 5, 5, 4, 4, 4, 3, 3, 2, 3, 1, 1, 3, 2, 2, 1, 1, 3, 3, 1, 2, 2, 1, 1, 3, 1, 2, 1, 1, 3, 2, 1, 2, 2, 1, 2, 3, 1, 2, 3, 1, 3, 3, 1, 2, 2, 2, 1, 2, 1, 1, 1, 1, 3, 3, 6, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 3, 5, 2, 2, 1, 1, 2, 1, 2, 2, 1, 3, 2, 4, 1, 2, 5, 4, 5, 1, 4, 4, 1, 4, 3, 3, 3, 3, 2, 1]