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.

A048823 a(n) = value of n defined as follows: start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by subtracting 1. The division steps are free, but subtracting 1 costs 1 point. The "value" of n is the smallest cost to reach 2.

Table of values

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

List of values

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