login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033810 Number of people needed so that probability of at least two sharing a birthday out of n possible days is at least 50%. 4
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, 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, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(365)=23 is the solution to the Birthday Problem.

REFERENCES

S. E. Ahmed & R. J. McIntosh, An Asymptotic Approximation for the Birthday Problem, Crux Mathematicorum 26(3) 151-5 2000 CMS.

LINKS

T. D. Noe, Table of n, a(n) for n=1..366

Mathforum, The Birthday Problem

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Essentially the same as A088141.

Sequence in context: A194287 A194303 A124755 * A023965 A087847 A107436

Adjacent sequences:  A033807 A033808 A033809 * A033811 A033812 A033813

KEYWORD

nonn,easy,nice

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:23 EST 2012. Contains 205694 sequences.