The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213603 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. 2
 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, 117, 21, 203, 145, 31, 62, 22, 11, 595, 21, 37, 703, 247, 65, 41, 287, 301, 473, 165, 23, 1081, 47, 49, 1225, 425, 221, 689, 159, 45, 385, 133, 551, 1711, 295, 305 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 REFERENCES 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.) LINKS EXAMPLE 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 CROSSREFS Cf. A213602. Sequence in context: A140393 A000170 A038216 * A145911 A234041 A027626 Adjacent sequences:  A213600 A213601 A213602 * A213604 A213605 A213606 KEYWORD nonn,frac AUTHOR William Rex Marshall, Jun 15 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 22 03:52 EDT 2021. Contains 345367 sequences. (Running on oeis4.)