OFFSET
0,2
COMMENTS
In Bátfai's notation, a(n) gives the total number of Turing machines with n states.
LINKS
Norbert Bátfai, On the Running Time of the Shortest Programs, arXiv:0908.1159 [cs.CC], Aug 10, 2009.
MATHEMATICA
Table[(6n+1)^(2n)-1, {n, 0, 20}] (* Harvey P. Dale, Dec 24 2021 *)
PROG
(Maxima) makelist((6*n + 1)^(2*n) - 1, n, 0, 20); /* Franck Maminirina Ramaharo, Jan 15 2019 */
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Aug 11 2009
EXTENSIONS
Edited and name clarified by Franck Maminirina Ramaharo, Jan 15 2019
STATUS
approved