The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A039708 a(n) = min{m: Sum_{x=0..m} binomial(n,x) >= 0.95*2^n}. 1
 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; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS If you toss an idealized coin n times, then the probability of obtaining more than a(n) "heads" is <= 5 percent. LINKS Table of n, a(n) for n=0..73. MATHEMATICA a[0] = 0; a[n_] := a[n] = For[m = a[n - 1], True, m++, If[Sum[Binomial[n, x], {x, 0, m}] >= 95/100*2^n, Return[m]]]; Table[a[n], {n, 0, 73}] (* Jean-François Alcover, Oct 11 2012 *) CROSSREFS Cf. A051889 (similar for a 6-sided die). Sequence in context: A340792 A112232 A168389 * A189730 A249569 A094500 Adjacent sequences: A039705 A039706 A039707 * A039709 A039710 A039711 KEYWORD easy,nice,nonn AUTHOR Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 14 1999 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 3 22:46 EDT 2023. Contains 363116 sequences. (Running on oeis4.)