A143797 - cp's OEIS frontend

A143797 Ackermann-Buck function, defined recursively by A(0,n) = n+1, A(1,0) = 2, A(2,0) = 0, A(n+3,0) = 1, A(m+1,n+1) = A(m,A(m+1,n)) for any nonnegative integers n, m. Table read by antidiagonals, the second term being A(0,1).

n	a(n)
0	1
1	2
2	2
3	3
4	3
5	0
6	4
7	4
8	2
9	1
10	5
11	5
12	4
13	2
14	1
15	6
16	6
17	6
18	4
19	2
20	1
21	7
22	7
23	8
24	8
25	4
26	2
27	1
28	8
29	8
30	10
31	16
32	16
33	4
34	2
35	1
36	9
37	9
38	12
39	32
40	65536
41	65536
42	4
43	2
44	1
45	10
46	10
47	14
48	64

[1, 2, 2, 3, 3, 0, 4, 4, 2, 1, 5, 5, 4, 2, 1, 6, 6, 6, 4, 2, 1, 7, 7, 8, 8, 4, 2, 1, 8, 8, 10, 16, 16, 4, 2, 1, 9, 9, 12, 32, 65536, 65536, 4, 2, 1, 10, 10, 14, 64]

cp's OEIS Frontend

A143797 Ackermann-Buck function, defined recursively by A(0,n) = n+1, A(1,0) = 2, A(2,0) = 0, A(n+3,0) = 1, A(m+1,n+1) = A(m,A(m+1,n)) for any nonnegative integers n, m. Table read by antidiagonals, the second term being A(0,1).

Table of values

List of values