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.

A066919 a(n) = least number of applications of f to n to reach 1, where f is defined by f(n) = phi(n) if n is even; = sigma(n) if n is odd.

Table of values

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

List of values

[0, 1, 3, 2, 3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 5, 4, 4, 3, 5, 4, 6, 4, 5, 4, 7, 4, 6, 4, 5, 4, 6, 5, 6, 5, 6, 4, 5, 4, 6, 5, 5, 4, 6, 5, 6, 5, 6, 5, 8, 5, 6, 5, 5, 4, 6, 5, 7, 5, 6, 5, 6, 5, 7, 6, 6, 5, 7, 6, 7, 5, 6, 5, 6, 5, 7, 5, 7, 5, 7, 6, 10, 6, 6, 5, 6, 5, 7, 6, 6, 5, 7, 6, 8, 6, 7, 6, 6, 5, 7, 6, 7, 6, 7, 6]