login
A164278
a(n) = (6*n + 1)^(2*n) - 1.
1
0, 48, 28560, 47045880, 152587890624, 819628286980800, 6582952005840035280, 73885357344138503765448, 1104427674243920646305299200, 21209401372879911350250244140624, 508858109619679129936596364708525200
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
Cf. A028444.
Sequence in context: A223264 A223196 A159665 * A159441 A011787 A345646
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Aug 11 2009
EXTENSIONS
Edited and name clarified by Franck Maminirina Ramaharo, Jan 15 2019
STATUS
approved