%I #9 May 24 2018 13:21:50
%S 0,1,1,1,4,1,2,7,7,2,2,12,18,12,2,3,17,37,37,17,3,3,24,64,88,64,24,3,
%T 4,31,102,176,176,102,31,4,4,40,151,316,400,316,151,40,4
%N Triangle read by rows: T(n,k) (0 <= k <= n) arises from the chain algorithm for the "Just"- or J-version of the n-coin group testing game.
%H F. K. Hwang, <a href="https://doi.org/10.1137/0605016">Three versions of a group testing game</a>, SIAM J. Algebraic Discrete Methods 5 (1984), no. 2, 145--153. MR0745434 (85d:90120).
%e Triangle begins:
%e 0,
%e 1, 1,
%e 1, 4, 1,
%e 2, 7, 7, 2,
%e 2, 12, 18, 12, 2,
%e 3, 17, 37, 37, 17, 3,
%e 3, 24, 64, 88, 64, 24, 3,
%e 4, 31, 102, 176, 176, 102, 31, 4,
%e 4, 40, 151, 316, 400, 316, 151, 40, 4,
%e ...
%K nonn,tabl,more
%O 0,5
%A _N. J. A. Sloane_, Apr 23 2014