%I
%S 1,0,1,0,0,1,1,0,0,0,1,2,2,0,1,0,0,0,0,1,3,5,5,3,4,0,3,0,0,0,1,0,0,0,
%T 0,0,1,4,9,14,17,15,17,10,14,4,10,2,7,0,6,0,0,0,4,0,0,0,0,0,0,0,1,0,0,
%U 0,0,0,0,1,5,14,28,45,60,67,78,66,81,51,73,33,65,29,40,4,47,14,24,5,23,0,12
%N Table T(n,k) = number of strictly increasing addition chains of length n whose final value is k.
%C Row n has 2^(n1) entries (starting with n1 zeros).
%e Table starts:
%e 1,
%e 0,1,
%e 0,0,1,1,
%e 0,0,0,1,2,2,0,1,
%e 0,0,0,0,1,3,5,5,3,4,0,3,0,0,0,1,
%Y Row sums A008933, column sums A008928.
%K nonn,tabl
%O 1,12
%A _Franklin T. AdamsWatters_, Mar 22 2006
