%I #6 Oct 04 2012 10:28:39
%S 1,2,0,1,0,1,2,0,2,0,1,2,2,0,1,2,0,4,2,2,0,1,0,3,8,3,0,1,2,0,10,4,6,6,
%T 2,0,1,2,8,6,14,16,4,0,1,2,0,8,12,28,22,12,8,2,0,1,2,9,22,34,34,38,26,
%U 5,0,1,2,0,10,20,60,70,64,54,26,8,2,0,1,2,14,22,67,130,132,96
%N Triangle T(n,k) giving number of codewords with k runs in Varshamov-Tenengolts code VT_0(n) of length n (n >= 1, 1<=k<=n).
%H N. J. A. Sloane, <a href="http://neilsloane.com/doc/dijen.txt">On single-deletion-correcting codes</a>
%e 1; 2,0; 1,0,1; 2,0,2,0; 1,2,2,0; ...
%Y Cf. A054529, A054530.
%K nonn,tabl,nice
%O 1,2
%A _N. J. A. Sloane_, Apr 09 2000