id:A033810 - OEIS Search Results

Search: id:A033810

Displaying 1-1 of 1 results found.

page 1

Number of people needed so that probability of at least two sharing a birthday out of n possible days is at least 50%.

+0
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; listen)

	OFFSET	`1,1`
	COMMENT	`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: A071996 A072747 A124755 this_sequence A023965 A087847 A107436` `Adjacent sequences: A033807 A033808 A033809 this_sequence A033811 A033812 A033813`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research