Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051889
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051889 a(n)=min{m: sum(binomial(n,i)*(1/6)^i*(1-1/6)^(n-i),i=0..m)>=.95}. +0
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; listen)
OFFSET

0,4

COMMENT

If you toss an idealized (six-sided) dice n times, then the probability of obtaining more than a(n) 6's is <= 5 percent.

CROSSREFS

A039708.

Sequence in context: A140437 A050500 A076885 this_sequence A086707 A072912 A025786

Adjacent sequences: A051886 A051887 A051888 this_sequence A051890 A051891 A051892

KEYWORD

easy,nice,nonn

AUTHOR

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 15 1999

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research