A383236 - cp's OEIS frontend

A383236 The least number of applications of Ackermann-Péter functions to reach n, starting from 0.

n	a(n)
1	1
2	2
3	3
4	4
5	4
6	5
7	5
8	6
9	6
10	7
11	7
12	8
13	5
14	6
15	7
16	8
17	8
18	9
19	9
20	10
21	9
22	10
23	10
24	11
25	10
26	11
27	11
28	12
29	6
30	7
31	8
32	9
33	10
34	11
35	11
36	12
37	11
38	12
39	12
40	13
41	12
42	13
43	13
44	14
45	12
46	13
47	13
48	14
49	13
50	14
51	14
52	15
53	13
54	14
55	14
56	15
57	14
58	15
59	15
60	16
61	7
62	8
63	9
64	10

[1, 2, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 5, 6, 7, 8, 8, 9, 9, 10, 9, 10, 10, 11, 10, 11, 11, 12, 6, 7, 8, 9, 10, 11, 11, 12, 11, 12, 12, 13, 12, 13, 13, 14, 12, 13, 13, 14, 13, 14, 14, 15, 13, 14, 14, 15, 14, 15, 15, 16, 7, 8, 9, 10]

cp's OEIS Frontend

A383236 The least number of applications of Ackermann-Péter functions to reach n, starting from 0.

Table of values

List of values

n	a(n)
1	1
2	2
3	3
4	4
5	4
6	5
7	5
8	6
9	6
10	7
11	7
12	8
13	5
14	6
15	7
16	8
17	8
18	9
19	9
20	10
21	9
22	10
23	10
24	11
25	10
26	11
27	11
28	12
29	6
30	7
31	8
32	9
33	10
34	11
35	11
36	12
37	11
38	12
39	12
40	13
41	12
42	13
43	13
44	14
45	12
46	13
47	13
48	14
49	13
50	14
51	14
52	15
53	13
54	14
55	14
56	15
57	14
58	15
59	15
60	16
61	7
62	8
63	9
64	10

n	a(n)
1	1
2	2
3	3
4	4
5	4
6	5
7	5
8	6
9	6
10	7
11	7
12	8
13	5
14	6
15	7
16	8
17	8
18	9
19	9
20	10
21	9
22	10
23	10
24	11
25	10
26	11
27	11
28	12
29	6
30	7
31	8
32	9
33	10
34	11
35	11
36	12
37	11
38	12
39	12
40	13
41	12
42	13
43	13
44	14
45	12
46	13
47	13
48	14
49	13
50	14
51	14
52	15
53	13
54	14
55	14
56	15
57	14
58	15
59	15
60	16
61	7
62	8
63	9
64	10

n	a(n)
1	1
2	2
3	3
4	4
5	4
6	5
7	5
8	6
9	6
10	7
11	7
12	8
13	5
14	6
15	7
16	8
17	8
18	9
19	9
20	10
21	9
22	10
23	10
24	11
25	10
26	11
27	11
28	12
29	6
30	7
31	8
32	9
33	10
34	11
35	11
36	12
37	11
38	12
39	12
40	13
41	12
42	13
43	13
44	14
45	12
46	13
47	13
48	14
49	13
50	14
51	14
52	15
53	13
54	14
55	14
56	15
57	14
58	15
59	15
60	16
61	7
62	8
63	9
64	10