id:A039708 - OEIS Search Results

Search: id:A039708

Displaying 1-1 of 1 results found.

page 1

a(n)=min{m: sum(binomial(n,x),x=0..m)>=.95*2^n}.

+0
2

0, 1, 2, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 11, 11, 12, 12, 13, 14, 14, 15, 15, 16, 17, 17, 18, 18, 19, 19, 20, 21, 21, 22, 22, 23, 23, 24, 25, 25, 26, 26, 27, 27, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38, 39, 39, 40, 40, 41, 41, 42, 42, 43, 44 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	If you toss an idealized coin n times, then the probability of obtaining more than a(n) ``heads'' is <= 5 percent.
	CROSSREFS	`Sequence in context: A099801 A099802 A112232 this_sequence A094500 A049473 A154951` `Adjacent sequences: A039705 A039706 A039707 this_sequence A039709 A039710 A039711`
	KEYWORD	`easy,nice,nonn`
	AUTHOR	`Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 14 1999`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research