%N Total number of machines with n states in "On the Running Time of the Shortest Programs"
%C The Kolmogorov complexity of the word w is equal to the length of the shortest concatenation of program Z and its input x with which the word w is computed by the universal Turing machine U. The question introduced in this paper is the following: How long do the shortest programs run for?
%H Norbert Batfai, <a href="http://arxiv.org/abs/0908.1159">On the Running Time of the Shortest Programs</a>, Aug 10, 2009.
%F a(n) = ((6*n + 1)^(2*n)) - 1.
%Y Cf. A028444.
%A _Jonathan Vos Post_, Aug 11 2009