A061282 - cp's OEIS frontend

A061282 Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 3. A stopping problem: begin with n and at each stage if a multiple of 3 divide by 3, otherwise subtract 1.

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

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

cp's OEIS Frontend

A061282 Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 3. A stopping problem: begin with n and at each stage if a multiple of 3 divide by 3, otherwise subtract 1.

Table of values

List of values

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

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

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