|
Search: id:A068996
|
|
|
| A068996 |
|
Decimal expansion of 1 - 1/e. |
|
+0
4
|
|
| 6, 3, 2, 1, 2, 0, 5, 5, 8, 8, 2, 8, 5, 5, 7, 6, 7, 8, 4, 0, 4, 4, 7, 6, 2, 2, 9, 8, 3, 8, 5, 3, 9, 1, 3, 2, 5, 5, 4, 1, 8, 8, 8, 6, 8, 9, 6, 8, 2, 3, 2, 1, 6, 5, 4, 9, 2, 1, 6, 3, 1, 9, 8, 3, 0, 2, 5, 3, 8, 5, 0, 4, 2, 5, 5, 1, 0, 0, 1, 9, 6, 6, 4, 2, 8, 5, 2, 7, 2, 5, 6, 5, 4, 0, 8, 0, 3, 5, 6
(list; cons; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
From the "derangements" problem: this is the probability that if a large number of people are given their hats at random, at least one person gets their own hat.
1-1/e is the limit to which (1 - !n/n!) {= 1 - A000166(n)/A000142(n) = A002467(n)/A000142(n)} converges as n tends to infinity. - Lekraj Beedassy (blekraj(AT)yahoo.com), Apr 14 2005
|
|
REFERENCES
|
S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.3.
A. Hald, A History of Probability and Statistics and Their Applications before 1750, Wiley, NY, 1990 (Chapter 19).
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 65.
|
|
LINKS
|
B. Conrey & T. Davis, Derangements
Eric Weisstein's World of Mathematics, e
|
|
EXAMPLE
|
.6321205588285576784044762...
|
|
CROSSREFS
|
Cf. A000166, A068985.
Adjacent sequences: A068993 A068994 A068995 this_sequence A068997 A068998 A068999
Sequence in context: A122178 A126445 A033326 this_sequence A068924 A106224 A129203
|
|
KEYWORD
|
nonn,cons
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 08 2002
|
|
|
Search completed in 0.002 seconds
|
