login
A241185
Triangle read by rows: T(n,k) (0 <= k <= n) arises from the star algorithm for the "Just"- or J-version of the n-coin group testing game.
0
0, 1, 1, 1, 4, 1, 2, 7, 7, 2, 2, 13, 16, 13, 2, 3, 18, 36, 36, 18, 3, 3, 27, 60, 90, 60, 27, 3, 4, 34, 102, 173, 173, 102, 34, 4, 4, 46, 148, 323, 380, 323, 148, 46, 4, 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, 13, 16, 13, 2,
3, 18, 36, 36, 18, 3,
3, 27, 60, 90, 60, 27, 3,
4, 34, 102, 173, 173, 102, 34, 4,
4, 46, 148, 323, 380, 323, 148, 46, 4,
...
CROSSREFS
Cf. A241184.
Sequence in context: A016685 A141332 A241184 * A243584 A084460 A216863
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Apr 23 2014
STATUS
approved