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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051889 a(n) = min{m: Sum_{j=0..m} binomial(n,j)*(1/6)^j*(1-1/6)^(n-i) >= 0.95}. 1
0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 19, 19, 19 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
If you toss an idealized (six-sided) die n times, then the probability of obtaining more than a(n) 6's is <= 5 percent.
LINKS
MATHEMATICA
s[m_, n_] := Sum[Binomial[n, i]*(1/6)^i*(1 - 1/6)^(n - i), {i, 0, m}]; a[0] = 0; a[n_] := a[n] = For[m = a[n - 1], True, m++, If[s[m, n] >= 95/100, Return[m]]]; Table[a[n], {n, 0, 80}] (* Jean-François Alcover, Oct 11 2012 *)
CROSSREFS
Cf. A039708 (similar for a coin).
Sequence in context: A076885 A274024 A285189 * A086707 A217538 A333348
KEYWORD
easy,nice,nonn
AUTHOR
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 15 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)