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.

A060937 Number of iterations of d(n) (A000005) needed to reach 2 starting at n (n is counted).

Table of values

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

List of values

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