A141475 - cp's OEIS frontend

A141475 Number of Turing machines with n states following the standard formalism of the busy beaver problem where the head of a Turing machine either moves to the right or to the left, but none once halted.

n	a(n)
0	1
1	36
2	10000
3	7529536
4	11019960576
5	26559922791424
6	95428956661682176
7	478296900000000000000
8	3189059870763703892770816
9	27296360116495644500385071104
10	291733167875766667063796853374976
11	3807783932766699862493193563344470016
12	59604644775390625000000000000000000000000

[1, 36, 10000, 7529536, 11019960576, 26559922791424, 95428956661682176, 478296900000000000000, 3189059870763703892770816, 27296360116495644500385071104, 291733167875766667063796853374976, 3807783932766699862493193563344470016, 59604644775390625000000000000000000000000]

cp's OEIS Frontend

A141475 Number of Turing machines with n states following the standard formalism of the busy beaver problem where the head of a Turing machine either moves to the right or to the left, but none once halted.

Table of values

List of values