|
%I #4 May 16 2003 03:00:00
%S 1,2,3,6,11,20,36,66,121,223,415,774,1452,2724,5133,9695,18358,34867,
%T 66320,126499,241563,462479,886150,1707353,3270338,6295073,12133953
%N A thinks of x in set M; B asks questions: is x in T?; A may lie once but only when true answer is Yes; a(n) is maximal size of M such that B can determine x with <= n questions.
%K nonn
%O 1,2
%A Thorsten Prenzel (prenzel(AT)unitas.or.uni-bonn.de)
|
