A213602 - OEIS

A213602

Numerator of expected minimum number of yes-no questions required to determine the value of a card randomly selected from a deck consisting of one 1, two 2's, three 3's, ..., and n n's.

%I #7 Jun 18 2012 12:25:06

%S 0,1,3,19,11,17,37,17,3,173,36,44,318,18,37,129,66,226,384,144,46,

%T 1074,99,109,287,523,95,929,671,145,293,105,53,2893,103,183,3505,1241,

%U 329,209,1473,1555,2459,863,121,5719,250,262,6584,2296,1200,3760,872,248

%N Numerator of expected minimum number of yes-no questions required to determine the value of a card randomly selected from a deck consisting of one 1, two 2's, three 3's, ..., and n n's.

%D M. Gardner, Problem 7 from Chapter 19, Sphere Packing, Lewis Carroll, and Reversi, Cambridge University Press, 2009, pages 245-246. Answers, pages 254-256. (Revised edition of New Mathematical Diversions, Mathematical Association of America, 1995, page 223. Answers, pages 230-232.)

%e 0, 1, 3/2, 19/10, 11/5, 17/7, 37/14, 17/6, 3, 173/55, 36/11, 44/13, 318/91, ... = A213602/A213603

%Y Cf. A213603.

%K nonn,frac

%O 1,3

%A _William Rex Marshall_, Jun 15 2012