login
A241184
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.
1
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, 4, 31, 102, 176, 176, 102, 31, 4, 4, 40, 151, 316, 400, 316, 151, 40, 4
OFFSET
0,5
LINKS
F. K. Hwang, Three versions of a group testing game, SIAM J. Algebraic Discrete Methods 5 (1984), no. 2, 145--153. MR0745434 (85d:90120).
EXAMPLE
Triangle begins:
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,
4, 31, 102, 176, 176, 102, 31, 4,
4, 40, 151, 316, 400, 316, 151, 40, 4,
...
CROSSREFS
Sequence in context: A293570 A016685 A141332 * A241185 A243584 A084460
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Apr 23 2014
STATUS
approved