|
| |
|
|
A001113
|
|
Decimal expansion of e.
(Formerly M1727 N0684)
|
|
232
| |
|
|
2, 7, 1, 8, 2, 8, 1, 8, 2, 8, 4, 5, 9, 0, 4, 5, 2, 3, 5, 3, 6, 0, 2, 8, 7, 4, 7, 1, 3, 5, 2, 6, 6, 2, 4, 9, 7, 7, 5, 7, 2, 4, 7, 0, 9, 3, 6, 9, 9, 9, 5, 9, 5, 7, 4, 9, 6, 6, 9, 6, 7, 6, 2, 7, 7, 2, 4, 0, 7, 6, 6, 3, 0, 3, 5, 3, 5, 4, 7, 5, 9, 4, 5, 7, 1, 3, 8, 2, 1, 7, 8, 5, 2, 5, 1, 6, 6, 4, 2, 7, 4, 2, 7, 4, 6
(list; constant; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| e is sometimes called Euler's constant, also Napier's constant.
Also, decimal expansion of sinh(1)+cosh(1) - Mohammad K. Azarian, Aug 15 2006
If m and n are any integers with n > 1, then |e - m/n| > 1/(S(n)+1)!, where S(n) = A002034(n) is the smallest number such that n divides S(n)!. - Jonathan Sondow, Sep 04 2006
Abs(A000166*e-A000142) -> 0. - Seiichi Kirikami, Oct 12 2011
Euler's constant (also known as Euler-Mascheroni constant) is gamma=0.57721... and Euler's number is e=2.71828... - Mohammad K. Azarian, Dec 29 2011
|
|
|
REFERENCES
| Mohammad K. Azarian, An Expansion of e, Problem # B-765, Fibonacci Quarterly, Vol. 32, No. 2, May 1994, p. 181. Solution appeared in Vol. 33, No. 4, Aug.1995, p. 377.
S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.3.
E. Maor, e: The Story of a Number, Princton Univ. Press, 1994.
Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 52.
G. W. Reitwiesner, An ENIAC determination of pi and e to more than 2000 decimal places. Math. Tables and Other Aids to Computation 4, (1950). 11-15.
D. Shanks and J. W. Wrench, Jr., Calculation of e to 100,000 decimals, Math. Comp., 23 (1969), 679-680.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. Sondow, A geometric proof that e is irrational and a new measure of its irrationality, Amer. Math. Monthly 113 (2006) 637-641 (article), 114 (2007) 659 (addendum).
|
|
|
LINKS
| N. J. A. Sloane, Table of 50000 digits of e labeled from 1 to 50000 [based on the ICON Project link below]
Dave's Math Tables, e
X. Gourdon, Plouffe's Inverter, e to 1.250 billion digits
X. Gourdon and P. Sebah, The constant e and its computation
ICON Project, e to 50000 places
R. Nemiroff and J. Bonnell, The first 5 million digits of the number e
J. J. O'Connor & E. F. Robertson, The number e
S. Plouffe, A million digits
E. Sandifer, How Euler Did It, Who proved e is irrational?
Jean-Louis Sigrist, Le premier million de decimales de e. [From Lekraj Beedassy, Sep 28 2009]
J. Sondow, A geometric proof that e is irrational and a new measure of its irrationality
J. Sondow and K. Schalm, Which partial sums of the Taylor series for e are convergents to e? (and a link to the primes 2, 5, 13, 37, 463), II, Gems in Experimental Mathematics (T. Amdeberhan, L. A. Medina, and V. H. Moll, eds.), Contemporary Mathematics, vol. 517, Amer. Math. Soc., Providence, RI, 2010.
G. Villemin's Almanach of Numbers, Constant"e"
Eric Weisstein's World of Mathematics, e
Eric Weisstein's World of Mathematics, Uniform Sum Distribution
Eric Weisstein's World of Mathematics, Factorial Sums
Wikipedia, E (mathematical constant)
|
|
|
FORMULA
| e = Sum_{k >= 0} 1/k! = lim_{x -> 0} (1+x)^(1/x).
e is the unique positive root of the equation Integral_{u = 1..x} du/u = 1.
exp(1) = (16/31*(sum((1/2)^n*(1/2*n^3+1/2*n+1)/n!,n=1..infinity) +1))^2. Robert Israel confirmed that above formula is correct, saying: "In fact, sum(n^j*t^n/n!, n=0..infinity) = P_j(t)*exp(t) where P_0(t) = 1 and for j >= 1, P_j(t) = t (P_(j-1)'(t) + P_(j-1)(t)). Your sum is 1/2*P_3(1/2) + 1/2*P_1(1/2) + P_0(1/2) ." [From Alexander R. Povolotsky, Jan 04 2009]
exp(1) = (1+ sum((1+n+n^3)/n!, n=1..infinity))/7. [From Alexander R. Povolotsky, Sep 14 2011]
|
|
|
EXAMPLE
| 2.71828182845904523536028747135266249775724709369995957496696762772407663\
0353547594571382178525166427427466391932003059921817413596629043572900334\
295260595630738132328627943490763233829880753195251019...
|
|
|
MAPLE
| Digits := 200: it := evalf((exp(1))/10, 200): for i from 1 to 200 do printf(`%d, `, floor(10*it)): it := 10*it-floor(10*it): od:
|
|
|
MATHEMATICA
| a := N[E, 500]; For[n = 1, n < 250, n++, Print[Floor[10^(n - 1)*a] - Floor[10^(n - 2)*a]*10]] - Stefan Steinerberger, Feb 17 2006
RealDigits[E, 10, 120][[1]] (* From Harvey P. Dale, Nov 14 2011 *)
|
|
|
PROG
| (PARI) { default(realprecision, 50080); x=exp(1); for (n=1, 50000, d=floor(x); x=(x-d)*10; write("b001113.txt", n, " ", d)); } [From Harry J. Smith, Apr 15 2009]
|
|
|
CROSSREFS
| Cf. A002034, A122214, A122215, A122216, A122217, A122416, A122417.
Sequence in context: A170936 A111714 A060302 * A198128 A094121 A105178
Adjacent sequences: A001110 A001111 A001112 * A001114 A001115 A001116
|
|
|
KEYWORD
| nonn,cons,nice,core
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Feb 13 2001
|
| |
|
|
