std/AIT/Beavers.bruijn


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

# MIT License, Copyright (c) 2023 Marvin Borner
# all currently known binary busy beavers
# originally proposed and calculated by John Tromp

# reduction results in OEIS sequence A333479

invalid [0 0] [0 0]

# not possible
b1 invalid

# not possible
b2 invalid

# not possible
b3 invalid

# 4
b4 [0]

# not possible
b5 invalid

# 6
b6 [[0]]

# 7
b7 [[1]]

# 8
b8 [[[0]]]

# 9
b9 [[[1]]]

# 10
b10 [[[[0]]]]

# 11
b11 [[[[1]]]]

# 12
b12 [[[[[0]]]]]

# 13
b13 [[[[[1]]]]]

# 14
b14 [[[[[[0]]]]]]

# 15
b15 [[[[[[1]]]]]]

# 16
b16 [[[[[[[0]]]]]]]

# 17
b17 [[[[[[[1]]]]]]]

# 18
b18 [[[[[[[[0]]]]]]]]

# 19
b19 [[[[[[[[1]]]]]]]]

# 20
b20 [[[[[[[[[0]]]]]]]]]

# 22
b21 [[0 0] (0 [1])]

# 24
b22 [[0 0 0] (0 0)]

# 26
b23 [[0 0] (0 [[1]])]

# 30
b24 [[0 0 0] (0 [0])]

# 42
b25 [[0 0] [0 (1 0)]]

# 52
b26 [0 0] [[1 (0 1)]]

# 44
b27 [[[0 0] [0 (1 0)]]]

# 58
b28 [[0 0] [0 (1 [1])]]

# 223
b29 [[0 0] [0 (0 (1 0))]]

# 160
b30 [0 0 0] [[1 (0 1)]]

# 267
b31 [0 0] [[1 (1 (0 1))]]

# 298
b32 [[0 0] [0 (0 (1 [1]))]]

# 1812
b33 [[0 0] [0 (0 (0 (1 0)))]]

# 327686
b34 [0 0 0 0] [[1 (1 0)]]

# 38127987424941
b35 [0 0 0] [[1 (1 (1 0))]]

# 578960446186580977117854925043439539266349923328202820197287920039565648199686
b36 [0 0] [0 (0 [[1 (1 0)]])]