A010033 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A010033

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.

0

1, 2, 3, 6, 11, 20, 36, 66, 121, 223, 415, 774, 1452, 2724, 5133, 9695, 18358, 34867, 66320, 126499, 241563, 462479, 886150, 1707353, 3270338, 6295073, 12133953

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..27.

CROSSREFS

Sequence in context: A017992 A018172 A018076 * A065615 A054182 A358709

Adjacent sequences: A010030 A010031 A010032 * A010034 A010035 A010036

KEYWORD

nonn

AUTHOR

Thorsten Prenzel (prenzel(AT)unitas.or.uni-bonn.de)

STATUS

approved