Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033810
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A033810
%S A033810 2,2,3,3,3,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,8,8,8,
%T A033810 8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,
%U A033810 10,10,10,10,11,11,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12
%N A033810 Number of people needed so that probability of at least two sharing a 
               birthday out of n possible days is at least 50%.
%C A033810 a(365)=23 is the solution to the Birthday Problem.
%D A033810 S. E. Ahmed & R. J. McIntosh, An Asymptotic Approximation for the Birthday 
               Problem, Crux Mathematicorum 26(3) 151-5 2000 CMS.
%H A033810 T. D. Noe, <a href="b033810.txt">Table of n, a(n) for n=1..366</a>
%H A033810 Mathforum, <a href="http://mathforum.org/dr.math/faq/faq.birthdayprob.html">
               The Birthday Problem</a>
%H A033810 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               BirthdayProblem.html">Link to a section of The World of Mathematics.</
               a>
%Y A033810 Essentially the same as A088141.
%Y A033810 Sequence in context: A071996 A072747 A124755 this_sequence A023965 A087847 
               A107436
%Y A033810 Adjacent sequences: A033807 A033808 A033809 this_sequence A033811 A033812 
               A033813
%K A033810 nonn,easy,nice
%O A033810 1,1
%A A033810 Eric Weisstein (eric(AT)weisstein.com)

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research