A048825 - cp's OEIS frontend

A048825 Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding 1. The division steps are free, but adding 1 costs 1 point. a(n) is the smallest cost to reach 2.

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

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

cp's OEIS Frontend

A048825 Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding 1. The division steps are free, but adding 1 costs 1 point. a(n) is the smallest cost to reach 2.

Table of values

List of values

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

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

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