A164278 a(n) = (6*n + 1)^(2*n) - 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

Table of n, a(n) for n=0..10.

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

Adjacent sequences: A164275 A164276 A164277 * A164279 A164280 A164281

Keyword

easy,nonn

Author

Jonathan Vos Post, Aug 11 2009

Extensions

Edited and name clarified by Franck Maminirina Ramaharo, Jan 15 2019

Status

approved