%I A088141
%S A088141 1,2,2,2,3,3,3,3,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,7,7,7,7,
%T A088141 7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,9,9,9,10,10,
%U A088141 10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,11
%N A088141 a(n) = the largest k such that, if k samples are taken from a group of 
               n items, with replacement, a duplication is unlikely (p<1/2).
%C A088141 Related to the birthday paradox. This is essentially the same as A033810.
%e A088141 a(365)=22 because if 22 people are sampled, it is unlikely that two have 
               the same birthday; but if 23 are sampled, it is likely.
%Y A088141 Cf. A033810, A072829.
%Y A088141 Sequence in context: A089051 A108229 A023966 this_sequence A083291 A003056 
               A117707
%Y A088141 Adjacent sequences: A088138 A088139 A088140 this_sequence A088142 A088143 
               A088144
%K A088141 nonn
%O A088141 2,2
%A A088141 Artemario Tadeu Medeiros da Silva (artemario(AT)uol.com.br), Nov 06 2003
%E A088141 Edited by Don Reble (djr(AT)nk.ca), Nov 07 2005