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.

A082091 a(n) = one more than the number of iterations of A005361 needed to reach 1 from the starting value n.

Table of values

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

List of values

[1, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 3, 2, 2, 2, 4, 2, 3, 2, 3, 2, 2, 2, 3, 3, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 4, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 4, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 3, 4, 2, 2, 2, 3, 2, 2]