Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Jun 18 2012 12:25:23
%S 1,1,2,10,5,7,14,6,1,55,11,13,91,5,10,34,17,57,95,35,11,253,23,25,65,
%T 117,21,203,145,31,62,22,11,595,21,37,703,247,65,41,287,301,473,165,
%U 23,1081,47,49,1225,425,221,689,159,45,385,133,551,1711,295,305
%N Denominator 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. A213602.
%K nonn,frac
%O 1,3
%A _William Rex Marshall_, Jun 15 2012