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.

A276806 Height of the shortest binary factorization tree of n.

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 2, 0, 1, 1, 2, 0, 2, 0, 2, 1, 1, 0, 2, 1, 1, 2, 2, 0, 2, 0, 3, 1, 1, 1, 2, 0, 1, 1, 2, 0, 2, 0, 2, 2, 1, 0, 3, 1, 2, 1, 2, 0, 2, 1, 2, 1, 1, 0, 2, 0, 1, 2, 3, 1, 2, 0, 2, 1, 2, 0, 3, 0, 1, 2, 2, 1, 2, 0, 3, 2, 1, 0, 2, 1, 1, 1, 2, 0, 2, 1, 2, 1, 1, 1, 3, 0, 2, 2, 2]