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.

A322163 Minimal number of steps needed to get from n to 1, where for n > 1 the next step is to either n-1 or max(a,b) for any a > 1 and b > 1 such that ab=n.

Table of values

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

List of values

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