A068985 -id:A068985 - cp's OEIS frontend

A094816 Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n.

1, 1, 1, 1, 3, 1, 1, 8, 6, 1, 1, 24, 29, 10, 1, 1, 89, 145, 75, 15, 1, 1, 415, 814, 545, 160, 21, 1, 1, 2372, 5243, 4179, 1575, 301, 28, 1, 1, 16072, 38618, 34860, 15659, 3836, 518, 36, 1, 1, 125673, 321690, 318926, 163191, 47775, 8274, 834, 45, 1, 1, 1112083, 2995011

Offset: 0

Philippe Deléham, Jun 12 2004

The a-sequence for this Sheffer matrix is A027641(n)/A027642(n) (Bernoulli numbers) and the z-sequence is A130189(n)/ A130190(n). See the W. Lang link.
Take the lower triangular matrix in A049020 and invert it, then read by rows! - N. J. A. Sloane, Feb 07 2009
Exponential Riordan array [exp(x), log(1/(1-x))]. Equal to A007318*A132393. - Paul Barry, Apr 23 2009
A signed version of the triangle appears in [Gessel]. - Peter Bala, Aug 31 2012
T(n,k) is the number of permutations over all subsets of {1,2,...,n} (Cf. A000522) that have exactly k cycles.  T(3,2) = 6: We permute the elements of the subsets {1,2}, {1,3}, {2,3}. Each has one permutation with 2 cycles.  We permute the elements of {1,2,3} and there are three permutations that have 2 cycles. 3*1 + 1*3 = 6. - Geoffrey Critzer, Feb 24 2013
From Wolfdieter Lang, Jul 28 2017: (Start)
In Chihara's book the row polynomials (with rising powers) are the Charlier polynomials (-1)^n*C^(a)_n(-x), with a = -1, n >= 0. See  p. 170, eq. (1.4).
In Ismail's book the present Charlier polynomials are denoted by C_n(-x;a=1) on p. 177, eq. (6.1.25). (End)
The triangle T(n,k) is a representative of the parametric family of triangles T(m,n,k), whose columns are the coefficients of the standard expansion of the function f(x) = (-log(1-x))^(k)*exp(-m*x)/k! for the case m=-1. See A381082. - Igor Victorovich Statsenko, Feb 14 2025

			From _Paul Barry_, Apr 23 2009: (Start)
Triangle begins
  1;
  1,     1;
  1,     3,     1;
  1,     8,     6,     1;
  1,    24,    29,    10,     1;
  1,    89,   145,    75,    15,    1;
  1,   415,   814,   545,   160,   21,   1;
  1,  2372,  5243,  4179,  1575,  301,  28,  1;
  1, 16072, 38618, 34860, 15659, 3836, 518, 36, 1;
Production matrix is
  1, 1;
  0, 2, 1;
  0, 1, 3,  1;
  0, 1, 3,  4,  1;
  0, 1, 4,  6,  5,  1;
  0, 1, 5, 10, 10,  6,  1;
  0, 1, 6, 15, 20, 15,  7,  1;
  0, 1, 7, 21, 35, 35, 21,  8, 1;
  0, 1, 8, 28, 56, 70, 56, 28, 9, 1; (End)

T. S. Chihara, An Introduction to Orthogonal Polynomials, Gordon and Breach, New York, London, Paris, 1978, Ch. VI, 1., pp. 170-172.
Classical and Quantum Orthogonal Polynomials in One Variable, Cambridge University Press, 2005, EMA, Vol. 98, p. 177.

Paul Barry, The Restricted Toda Chain, Exponential Riordan Arrays, and Hankel Transforms, J. Int. Seq. 13 (2010) # 10.8.4, example 6.
Paul Barry, Exponential Riordan Arrays and Permutation Enumeration, J. Int. Seq. 13 (2010) # 10.9.1, example 8.
Paul Barry, Riordan Arrays, Orthogonal Polynomials as Moments, and Hankel Transforms, J. Int. Seq. 14 (2011) # 11.2.2, example 22.
Paul Barry, Combinatorial polynomials as moments, Hankel transforms and exponential Riordan arrays, arXiv preprint arXiv:1105.3044 [math.CO], 2011, also J. Int. Seq. 14 (2011) 11.6.7.
Ira Gessel, Congruences for Bell and Tangent numbers, The Fibonacci Quarterly, Vol. 19, Number 2, 1981.
Aoife Hennessy and Paul Barry, Generalized Stirling Numbers, Exponential Riordan Arrays, and Orthogonal Polynomials, J. Int. Seq. 14 (2011) # 11.8.2.
Marin Knežević, Vedran Krčadinac, and Lucija Relić, Matrix products of binomial coefficients and unsigned Stirling numbers, arXiv:2012.15307 [math.CO], 2020.
Wolfdieter Lang, First 10 rows and more.
Wolfdieter Lang, On Generating functions of Diagonals Sequences of Sheffer and Riordan Number Triangles, arXiv:1708.01421 [math.NT], August 2017.
W. F. Lunnon, P. A. B. Pleasants, and N. M. Stephens, Arithmetic properties of Bell numbers to a composite modulus I, Acta Arithmetica 35 (1979), pp. 1-16.

Columns k=0..4 give A000012, A002104, A381021, A381022, A381023.
Diagonals: A000012, A000217.
Row sums A000522, alternating row sums A024000.
KummerU(-n,1-n-x,z): this sequence (z=1), |A137346| (z=2), A327997 (z=3).

A094816 := (n,k) -> (-1)^(n-k)*add(binomial(-j-1,-n-1)*Stirling1(j,k), j=0..n):
seq(seq(A094816(n, k), k=0..n), n=0..9); # Peter Luschny, Apr 10 2016

nn=10;f[list_]:=Select[list,#>0&];Map[f,Range[0,nn]!CoefficientList[Series[ Exp[x]/(1-x)^y,{x,0,nn}],{x,y}]]//Grid  (* Geoffrey Critzer, Feb 24 2013 *)
Flatten[Table[(-1)^(n-k) Sum[Binomial[-j-1,-n-1] StirlingS1[j,k],{j,0,n}], {n,0,9},{k,0,n}]] (* Peter Luschny, Apr 10 2016 *)
p[n_] := HypergeometricU[-n, 1 - n - x, 1];
Table[CoefficientList[p[n], x], {n,0,9}] // Flatten (* Peter Luschny, Oct 27 2019 *)

{T(n, k)= local(A); if( k<0 || k>n, 0, A = x * O(x^n); polcoeff( n! * polcoeff( exp(x + A) / (1 - x + A)^y, n), k))} /* Michael Somos, Nov 19 2006 */

def a_row(n):
    s = sum(binomial(n,k)*rising_factorial(x,k) for k in (0..n))
    return expand(s).list()
[a_row(n) for n in (0..9)] # Peter Luschny, Jun 28 2019

E.g.f.: exp(t)/(1-t)^x = Sum_{n>=0} C(x,n)*t^n/n!.
Sum_{k = 0..n} T(n, k)*x^k = C(x, n), Charlier polynomials; C(x, n)= A024000(n), A000012(n), A000522(n), A001339(n), A082030(n), A095000(n), A095177(n), A096307(n), A096341(n), A095722(n), A095740(n) for x = -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 respectively. - Philippe Deléham, Feb 27 2013
T(n+1, k) = (n+1)*T(n, k) + T(n, k-1) - n*T(n-1, k) with T(0, 0) = 1, T(0, k) = 0 if k>0, T(n, k) = 0 if k<0.
PS*A008275*PS as infinite lower triangular matrices, where PS is a triangle with PS(n, k) = (-1)^k*A007318(n, k). PS = 1/PS. - Gerald McGarvey, Aug 20 2009
T(n,k) = (-1)^(n-k)*Sum_{j=0..n} C(-j-1, -n-1)*S1(j, k) where S1 are the signed Stirling numbers of the first kind. - Peter Luschny, Apr 10 2016
Absolute values T(n,k) of triangle (-1)^(n+k) T(n,k) where row n gives coefficients of x^k, 0 <= k <= n, in expansion of Sum_{k=0..n} binomial(n,k) (-1)^(n-k) x^{(k)}, where x^{(k)} := Product_{i=0..k-1} (x-i), k >= 1, and x^{(0)} := 1, the falling factorial powers. - Daniel Forgues, Oct 13 2019
From Peter Bala, Oct 23 2019: (Start)
The n-th row polynomial is
   R(n, x) = Sum_{k = 0..n} (-1)^k*binomial(n, k)*k! * binomial(-x, k).
These polynomials occur in series acceleration formulas for the constant
   1/e = n! * Sum_{k >= 0} (-1)^k/(k!*R(n,k)*R(n,k+1)), n >= 0. (cf. A068985, A094816 and A137346). (End)
R(n, x) = KummerU[-n, 1 - n - x, 1]. - Peter Luschny, Oct 27 2019
Sum_{j=0..m} (-1)^(m-j) * Bell(n+j) * T(m,j) = m! * Sum_{k=0..n} binomial(k,m) * Stirling2(n,k). - Vaclav Kotesovec, Aug 06 2021
From Natalia L. Skirrow, Jun 11 2025: (Start)
G.f.: 2F0(1,y;x/(1-x)) / (1-x).
Polynomial for the n-th row is R(n,y) = 2F0(-n,y;-1).
Falling g.f. for n-th row: Sum_{k=0..n} a(n,k)*(y)_k = [x^0] 2F0(1,-n;-1/x) * (1+log(1/(1-x)))^y = [x^n] e^x * Gamma(n+1,x) * (1+log(1/(1-x)))^y, where (y)_k = y!/(y-k)! denotes the falling factorial. (End)

A083648 Decimal expansion of Sum_{n>=1} -(-1)^n/n^n = Integral_{x=0..1} x^x dx.

Original entry on oeis.org

7, 8, 3, 4, 3, 0, 5, 1, 0, 7, 1, 2, 1, 3, 4, 4, 0, 7, 0, 5, 9, 2, 6, 4, 3, 8, 6, 5, 2, 6, 9, 7, 5, 4, 6, 9, 4, 0, 7, 6, 8, 1, 9, 9, 0, 1, 4, 6, 9, 3, 0, 9, 5, 8, 2, 5, 5, 4, 1, 7, 8, 2, 2, 7, 0, 1, 6, 0, 0, 1, 8, 4, 5, 8, 9, 1, 4, 0, 4, 4, 5, 6, 2, 4, 8, 6, 4, 2, 0, 4, 9, 7, 2, 2, 6, 8, 9, 3, 8, 9, 7, 4, 8, 0, 0

Offset: 0

Eric W. Weisstein, May 01 2003

In 1697, Johann Bernoulli explores this curve and finds its minimum and the area under the curve from 0 to 1, all this without the benefit of the exponential function.

			0.78343051071213440705926438652697546940768199014693095825541782270...

William Dunham, The Calculus Gallery, Masterpieces from Newton to Lebesgue, Princeton University Press, Princeton, NJ 2005, pp. 46-51.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 6.11, p. 449.
Paul J. Nahin, An Imaginary Tale: The Story of sqrt(-1), Princeton, New Jersey: Princeton University Press (1988), p. 146.

G. C. Greubel, Table of n, a(n) for n = 0..5000
M. L. Glasser, A note on Beukers's and related integrals, Amer. Math. Monthly 126(4) (2019), 361-363.
Eric Weisstein's World of Mathematics, Power Tower.
Eric Weisstein's World of Mathematics, Sophomore's Dream.

Cf. A137420 (continued fraction expansion).

Cf. A073009. The minimum point on the curve x^x is (A068985, A072364).

RealDigits[ Sum[ -(-1)^n /n^n, {n, 1, 60}], 10, 111] [[1]] (* Robert G. Wilson v, Jan 31 2005 *)

-sumalt(n=1, (-1/n)^(n)) \\ Michel Marcus, Oct 15 2015

numerical_approx(-sum((-1/n)^n for n in (1..120)), digits=130) # G. C. Greubel, Mar 01 2019

Constant also equals the double integral Integral_{y = 0..1} Integral_{x = 0..1} (x*y)^(x*y) dx dy. - Peter Bala, Mar 04 2012
From Petros Hadjicostas, Jun 29 2020: (Start)
Equals -Integral_{x=0..1, y=0..1} (x*y)^(x*y)/log(x*y) dx dy. (Apply Theorem 1 or Theorem 2 of Glasser (2019) to Integral_{x=0..1} x^x dx.)
Equals -Integral_{x=0..1} x^x*log(x) dx. (Apply Theorem 1 or Theorem 2 of Glasser (2019) to the double integral of Peter Bala above.)
Without using the results in Glasser (2019), notice that Integral x^x*(1 + log(x)) dx = x^x + c, which implies Integral_{x=0..1} x^x dx = -Integral_{x=0..1} x^x*log(x) dx. (End)

A062119 a(n) = n! * (n-1).

Original entry on oeis.org

0, 2, 12, 72, 480, 3600, 30240, 282240, 2903040, 32659200, 399168000, 5269017600, 74724249600, 1133317785600, 18307441152000, 313841848320000, 5690998849536000, 108840352997376000, 2189611807358976000, 46225138155356160000, 1021818843434188800000

Offset: 1

Olivier Gérard, Jun 13 2001

For n > 0, a(n) = number of permutations of length n+1 that have 2 predetermined elements nonadjacent; e.g., for n=2, the permutations with, say, 1 and 2 nonadjacent are 132 and 231, therefore a(2)=2. - Jon Perry, Jun 08 2003
Number of multiplications performed when computing the determinant of an n X n matrix by definition. - Mats Granvik, Sep 12 2008
Sum of the length of all cycles (excluding fixed points) in all permutations of [n]. - Olivier Gérard, Oct 23 2012
Number of permutations of n distinct objects (ABC...) 1 (one) times >>("-", A, AB, ABC, ABCD, ABCDE, ..., ABCDEFGHIJK, infinity) and one after the other to resemble motif: A (1) AB (1-1), AAB (2-1), AAAB (3-1), AAAAB (4-1), AAAAAB (5-1), AAAAAAB (6-1), AAAAAAAB (7-1), AAAAAAAAB (8-1) etc.,>> "1(one) fixed point". Example:motif: AAAB (or BBBA) 12 * one (1) fixed point etc. Let: AAAB ................ 'A'BCD 1. 'A'BDC 2. 'A'CBD 3. ACDB 'A'DBC 4. 'A'DCB B'A'CD 5. B'A'DC 6. BCAD 7. BCDA BD'A'C 8. BDCA C'A'BD 9. C'A'DB CB'A'D 10. CBDA CDAB CDBA D'A'BC 11. DACB DB'A'C 12. DBCA DCAB DCBA. - Zerinvary Lajos, Nov 27 2009 (does anybody understand what this is supposed to say? - Joerg Arndt, Jan 10 2015)
a(n) is the number of ways to arrange n books on two bookshelves so that each shelf receives at least one book. - Geoffrey Critzer, Feb 21 2010
a(n) = number whose factorial base representation (A007623) begins with digit {n-1} and is followed by n-1 zeros. Viewed in that base, this sequence looks like this: 0, 10, 200, 3000, 40000, 500000, 6000000, 70000000, 800000000, 9000000000, A0000000000, B00000000000, ... (where "digits" A and B stand for placeholder values 10 and 11 respectively). - Antti Karttunen, May 07 2015

Harry J. Smith, Table of n, a(n) for n = 1..100
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
Ugbene Ifeanyichukwu Jeff, Ogundele Olaniyi Suraju, and Ndubuisi Rich Ugochukwu, Digraph of the full transformation semigroup, J. Disc. Math. Sci. Crypt. (2021).
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
S. R. Schmitt Determinants [From _Mats Granvik_, Sep 12 2008]
Index entries for sequences related to factorial base representation

Column 2 of A257503 (apart from initial zero. Equally, row 2 of A257505).
Cf. A001286 (same sequence divided by 2).
Cf. A000142, A007623, A018931, A052849.
Cf. A001563. - Zerinvary Lajos, Aug 27 2008
Cf. sequences with formula (n + k)*n! listed in A282466.
Cf. A001113, A001620, A068985, A091725, A099285.

a062119 n = (n - 1) * a000142 n  -- Reinhard Zumkeller, Aug 27 2012

G(x):=x^2/(1-x)^2: f[0]:=G(x): for n from 1 to 19 do f[n]:=diff(f[n-1],x) od: x:=0: seq(f[n],n=1..19); # Zerinvary Lajos, Apr 01 2009

a[n_]:=1*(n+2)!-2*(n+1)!; (* or *) a[n_]:=n!*(n-1); (* Vladimir Joseph Stephan Orlovsky, Dec 05 2008 *)
Table[n!(n-1),{n,20}] (* Harvey P. Dale, Aug 29 2021 *)

{ f=1; for (n=1, 100, f*=n; write("b062119.txt", n, " ", f*(n - 1)) ) } \\ Harry J. Smith, Aug 02 2009

a(n) = n!*(n-1); \\ Altug Alkan, May 04 2018

(define (A062119 n) (* (- n 1) (A000142 n))) ;; Antti Karttunen, May 07 2015

a(n) = n! * (n-1).
E.g.f.: x^2/(1-x)^2. - Geoffrey Critzer, Feb 21 2010
a(n) = 2 * A001286(n).
a(n) = A001563(n) - A000142(n). - Antti Karttunen, May 07 2015, hinted by crossref left by Lajos.
From Amiram Eldar, Jul 11 2020: (Start)
Sum_{n>=2} 1/a(n) = Ei(1) + 2 - e - gamma = A091725 + 2 - A001113 - A001620.
Sum_{n>=2} (-1)^n/a(n) = gamma - Ei(-1) - 1/e = A001620 + A099285 - A068985. (End)

Last term a(19) corrected by Harry J. Smith, Aug 02 2009

A091681 Decimal expansion of BesselJ(0,2).

Original entry on oeis.org

2, 2, 3, 8, 9, 0, 7, 7, 9, 1, 4, 1, 2, 3, 5, 6, 6, 8, 0, 5, 1, 8, 2, 7, 4, 5, 4, 6, 4, 9, 9, 4, 8, 6, 2, 5, 8, 2, 5, 1, 5, 4, 4, 8, 2, 2, 1, 8, 6, 0, 7, 6, 0, 3, 1, 2, 8, 3, 4, 9, 7, 0, 6, 0, 1, 0, 8, 5, 3, 9, 5, 7, 7, 6, 8, 0, 1, 0, 7, 0, 5, 0, 1, 4, 8, 1, 1, 5, 1, 1, 8, 5, 3, 4, 2, 9, 3, 6, 6, 0, 4, 9

Offset: 0

Eric W. Weisstein, Jan 28 2004

The Pierce Expansion of this number is the squares > 1: 4,9,16,25,... - Franklin T. Adams-Watters, May 22 2006

			0.223890779...

G. C. Greubel, Table of n, a(n) for n = 0..2500
Eric Weisstein's World of Mathematics, Factorial Sums
Eric Weisstein's World of Mathematics, Pierce Expansion

Cf A000290, A068985, A073701.

Bessel function values: A334380 (J(0,1)), A334383 (J(0,sqrt(2))), this sequence (J(0,2)), A197036 (I(0,1)), A334381 (I(0,sqrt(2))), A070910 (I(0,2)).

RealDigits[N[BesselJ[0, 2], 250]][[1]] (* G. C. Greubel, Dec 26 2016 *)

besselj(0,2) \\ Charles R Greathouse IV, Feb 19 2014

Equals Sum_{k>=0} (-1)^k/(k!)^2.
Continued fraction expansion: BesselJ(0,2) = 1/(4 + 4/(8 + 9/(15 + ... + (n - 1)^2/(n^2 + 1 + ...)))). See A073701 for a proof. - Peter Bala, Feb 01 2015
Equals BesselI(0,2*i), where BesselI is the modified Bessel function of order 0. - Jianing Song, Sep 18 2021

A068996 Decimal expansion of 1 - 1/e.

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane, Apr 08 2002

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, Apr 14 2005
Also, this is lim_{n->inf} P(n), where P(n) is the probability that a random rooted forest on [n] is not connected. - Washington Bomfim, Nov 01 2010
Also equals the mode of a Gompertz distribution when the shape parameter is less than 1. - Jean-François Alcover, Apr 17 2013
The asymptotic density of numbers with an even number of trailing zeros in their factorial base representation (A232744). - Amiram Eldar, Feb 26 2021

			0.6321205588285576784044762...

Steven R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.3, pp. 12-17.
Anders Hald, A History of Probability and Statistics and Their Applications before 1750, Wiley, NY, 1990 (Chapter 19).
John Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 65.

Brian Conrey and Tom Davis, Derangements.
Brady Haran and Tom Crawford, A Problem with Infinite Hotel Keys, YouTube Numberphile video, 2025.
MathOverflow, What is the effect of adding 1/2 to a continued fraction?.
Jonathan Sondow and Eric Weisstein, e, MathWorld.
Bala Subramanian, Why time constant is 63.2% not a 50 or 70%? (2018).
Index entries for transcendental numbers

Cf. A000166, A068985, A091131, A185393, A232744.

evalf[140](1-exp(-1));  # Alois P. Heinz, May 16 2025

RealDigits[1 - 1/E, 10, 100][[1]] (* Alonso del Arte, Jul 06 2012 *)

1 - exp(-1) \\ Michel Marcus, Mar 04 2016

Equals Integral_{x = 0 .. 1} exp(-x) dx. - Alonso del Arte, Jul 06 2012
Equals -Sum_{k>=1} (-1)^k/k!. - Bruno Berselli, May 13 2013
Equals Sum_{k>=0} 1/((2*k+2)*(2*k)!). - Fred Daniel Kline, Mar 03 2016
From Peter Bala, Nov 27 2019: (Start)
1 - 1/e =  Sum_{n >= 0} n!/(A(n)*A(n+1)), where A(n) = A000522(n).
Continued fraction expansion: [0; 1, 1, 1, 2, 1, 1, 4, 1, 1, 6, 1, 1, 8, ...].
Related continued fraction expansions include
2*(1 - 1/e) = [1; 3, 1, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 5, 3, 1, 5, ..., 1, 3, 2*n + 1, 3, 1, 2*n + 1, ...];
(1/2)*(1 - 1/e) = [0; 3, 6, 10, 14, 18, ..., 4*n + 2, ...];
4*(1 - 1/e) = [2; 1, 1, 8, 3, 1, 1, 1, 1, 7, 1, 1, 2, 1, 1, 1, 2, 7, 1, 2, 2, 1, 1, 1, 3, ..., 7, 1, n, 2, 1, 1, 1, n+1, ...];
(1/4)*(1 - 1/e) = [0; 6, 3, 20, 7, 36, 11, 52, 15, ..., 16*n + 4, 4*n + 3, ...]. (End)
Equals Integral_{x=0..1} x * cosh(x) dx. - Amiram Eldar, Aug 14 2020
Equals A091131/e. - Hugo Pfoertner, Aug 20 2024

A073230 Decimal expansion of (1/e)^e.

Original entry on oeis.org

0, 6, 5, 9, 8, 8, 0, 3, 5, 8, 4, 5, 3, 1, 2, 5, 3, 7, 0, 7, 6, 7, 9, 0, 1, 8, 7, 5, 9, 6, 8, 4, 6, 4, 2, 4, 9, 3, 8, 5, 7, 7, 0, 4, 8, 2, 5, 2, 7, 9, 6, 4, 3, 6, 4, 0, 2, 4, 7, 3, 5, 4, 1, 5, 6, 6, 7, 3, 6, 3, 3, 0, 0, 3, 0, 7, 5, 6, 3, 0, 8, 1, 0, 4, 0, 8, 8, 2, 4, 2, 4, 5, 3, 3, 7, 1, 4, 6, 7, 7, 4, 5, 6, 7

Offset: 0

Rick L. Shepherd, Jul 22 2002

(1/e)^e = e^(-e) = 1/(e^e) (reciprocal of A073226).

The power tower function f(x)=x^(x^(x^...)) is defined on the closed interval [e^(-e),e^(1/e)]. - Lekraj Beedassy, Mar 17 2005

			0.06598803584531253707679018759...

Paul Halmos, "Problems for Mathematicians, Young and Old", Dolciani Mathematical Expositions, 1991, Solution to problem 8A (Power Tower) p. 240.

G. C. Greubel, Table of n, a(n) for n = 0..10000
J. Sondow and D. Marques, Algebraic and transcendental solutions of some exponential equations, Annales Mathematicae et Informaticae 37 (2010) 151-164; see the Appendix.

Cf. A001113 (e), A068985 (1/e), A073229 (e^(1/e)), A072364 ((1/e)^(1/e)), A073226 (e^e).

Exp(-1)^Exp(1); // G. C. Greubel, May 29 2018

a=IntegerDigits[IntegerPart[(1/E)^E*10^99]];PrependTo[a,0] (* Vladimir Joseph Stephan Orlovsky, Jul 17 2008 *)
RealDigits[(1/E)^E, 10, 100][[1]] (* Alonso del Arte, Aug 26 2011 *)

PARI
```
exp(-1)^exp(1)
```

A099970 Write 1/e as a binary fraction; read this from left to right and whenever a 1 appears, note the integer formed by reading leftwards from that 1. Then convert those integers from binary into decimal numbers.

Original entry on oeis.org

1, 5, 13, 29, 61, 573, 2621, 6717, 23101, 88637, 350781, 875069, 9263677, 26040893, 93149757, 227367485, 2374851133, 10964785725, 28144654909, 165583608381, 440461515325, 990217329213, 3189240584765, 7587287095869, 16383380118077

Offset: 0

N. J. A. Sloane, Nov 13 2004, based on correspondence from Artur Jasinski, Mar 25 2003

			1/e = 0.367879441171442321595523770161460867445811131031767834507... = 0.010111100010110101011000110110001011001110111100110111110001101010111010110111 in binary.

Harvey P. Dale, Table of n, a(n) for n = 0..1000

Cf. A068985, A099969, A099971, A099972, A099973, A099974.

d = 100; l = First[RealDigits[N[1/E, d], 2]]; Do[m = Take[l, n]; k = Length[m]; If[m[[k]] == 1, Print[FromDigits[Reverse[m], 2]]], {n, 1, d}] (* Ryan Propper, Aug 18 2005 *)
Module[{nn=50,e},e=RealDigits[1/E,2, 50][[1]];Table[If[e[[n]]== 0, Nothing,FromDigits[ Reverse[Take[e,n]],2]],{n,nn}]] (* Harvey P. Dale, Sep 17 2020 *)

a(n) = A099969(n)/2. - Michel Marcus, Nov 03 2013

More terms from Ryan Propper, Aug 18 2005

Definition amended by Harvey P. Dale, Sep 17 2020

A346441 Decimal expansion of the constant Sum_{k>=0} (-1)^k/(3*k)!.

Original entry on oeis.org

8, 3, 4, 7, 1, 9, 4, 6, 8, 5, 7, 7, 2, 1, 0, 9, 6, 2, 2, 1, 9, 2, 8, 3, 2, 3, 9, 2, 0, 8, 3, 3, 0, 0, 7, 0, 8, 4, 0, 3, 7, 9, 0, 5, 1, 9, 9, 8, 2, 6, 9, 7, 6, 7, 6, 2, 7, 6, 9, 5, 1, 0, 7, 9, 5, 2, 5, 9, 2, 7, 8, 4, 3, 6, 8, 7, 2, 2, 2, 2, 3, 8, 9, 7, 3, 0, 0

Offset: 0

Sean A. Irvine, Jul 17 2021

			0.8347194685772109622192832392...

Peter Bala, A continued fraction for A346441
D. Bowman and J. Mc Laughlin, Polynomial continued fractions, Acta Arith. 103 (2002), no. 4, 329-342.
Michael I. Shamos, A catalog of the real numbers (2011).

Cf. A068985, A049470, A143819, A346440, A346439, A346438, A346437, A346436, A346435, A196498.

RealDigits[Sum[(-1)^k/(3*k)!, {k, 0, Infinity}], 10, 100][[1]] (* Amiram Eldar, Jul 18 2021 *)

sumalt(k=0, (-1)^k/(3*k)!) \\ Michel Marcus, Jul 18 2021

Equals 1/(3*e) + 2*sqrt(e)*cos(sqrt(3)/2)/3. - Amiram Eldar, Jul 18 2021

Continued fraction: 1/(1 + 1/(5 + 6/(119 + 120/(503 + ... + P(n-1)/((P(n) - 1) + ... ))))), where P(n) = (3*n)*(3*n - 1)*(3*n - 2) for n >= 1. See Bowman and Mc Laughlin, Corollary 10, p. 341 with m = 1, who also show that the constant is irrational. - Peter Bala, Feb 21 2024

A099969 Write 1/e as a binary fraction; read this from left to right and whenever a 1 appears, note the integer formed by reading leftwards from that 1.

Original entry on oeis.org

2, 10, 26, 58, 122, 1146, 5242, 13434, 46202, 177274, 701562, 1750138, 18527354, 52081786, 186299514, 454734970, 4749702266, 21929571450, 56289309818, 331167216762, 880923030650, 1980434658426, 6378481169530, 15174574191738

Offset: 0

N. J. A. Sloane, Nov 13 2004, based on correspondence from Artur Jasinski, Mar 25 2003

			1/e = 0.367879441171442321595523770161460867445811131031767834507... = 0.010111100010110101011000110110001011001110111100110111110001101010111010110111 in binary.
From the binary expansion we get 10 = 2, 1010 = 10, 11010 = 26, 111010 = 58, 1111010 = 122, etc.

Cf. A068985, A099970, A099971, A099972, A099973, A099974.

d = 100; l = First[RealDigits[N[1/E, d], 2]]; Do[m = Take[l, n]; k = Length[m]; If[m[[k]] == 1, Print[2*FromDigits[Reverse[m], 2]]], {n, 1, d}] (* Ryan Propper, Aug 18 2005 *)

More terms from Ryan Propper, Aug 18 2005

A092605 Decimal expansion of e^(-1/2) or 1/sqrt(e).

Original entry on oeis.org

6, 0, 6, 5, 3, 0, 6, 5, 9, 7, 1, 2, 6, 3, 3, 4, 2, 3, 6, 0, 3, 7, 9, 9, 5, 3, 4, 9, 9, 1, 1, 8, 0, 4, 5, 3, 4, 4, 1, 9, 1, 8, 1, 3, 5, 4, 8, 7, 1, 8, 6, 9, 5, 5, 6, 8, 2, 8, 9, 2, 1, 5, 8, 7, 3, 5, 0, 5, 6, 5, 1, 9, 4, 1, 3, 7, 4, 8, 4, 2, 3, 9, 9, 8, 6, 4, 7, 6, 1, 1, 5, 0, 7, 9, 8, 9, 4, 5, 6, 0, 2, 6, 4, 2, 3

Offset: 0

Mohammad K. Azarian, Apr 22 2004

For x = e^(-1/2), the largest prime factor of a random integer n is equally likely to be above or below n^x. - Charles R Greathouse IV, May 25 2009

Siegel's conjecture: this constant gives the density of regular primes among all the primes (see Ribenboim and Siegel). - Stefano Spezia, Apr 22 2025

			0.6065306597126334...

Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 225.
C. L. Siegel, Zu zwei Bemerkungen Kummers. Nachr. Akad. d. Wiss. Göttingen, Math. Phys. Kl., II, 1964, 51-62. Reprinted in Gesammelte Abhandlungen (edited by K. Chandrasekharan and H. Maas), Vol. III, 436-442. Springer-Verlag, Berlin, 1966.

Michael I. Shamos, A catalog of the real numbers, (2007). See p. 502.
Index entries for transcendental numbers.

Cf. A000165, A001113, A019774, A068985, A290506.

RealDigits[E^-(1/2),10,120][[1]] (* Harvey P. Dale, Jul 23 2012 *)

exp(-.5) \\ Charles R Greathouse IV, Oct 02 2022

Equals Sum_{k>=0} (-1)^k/(2^k * k!) = Sum_{k>=0} (-1)^k/A000165(k). - Amiram Eldar, Aug 15 2020
From Peter Bala, Jan 16 2022; (Start)
Equals 16*Sum_{n >= 0} (-1)^n*n^2/((4*n^2 - 1)*(4*n^2 - 9)*(2^n)*n!).
Equals 8*Sum_{n >= 0} (-1)^n/(p(n)*p(n+1)*(2^n)*n!), where p(n) = 4*n^2 + 8*n + 1.
Equals 48*Sum_{n >= 0} (-1)^n/(q(n)*q(n+1)*(2^n)*n!), where q(n) = 8*n^3 + 36*n^2 + 34*n + 1. (End)
Equals i^(i/Pi), where i denotes the imaginary unit. - Stefano Spezia, Mar 01 2025
Equals 1 - A290506. - Amiram Eldar, Apr 22 2025

cp's OEIS Frontend

A094816 Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

A083648 Decimal expansion of Sum_{n>=1} -(-1)^n/n^n = Integral_{x=0..1} x^x dx.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

A062119 a(n) = n! * (n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Scheme

Formula

Extensions

A091681 Decimal expansion of BesselJ(0,2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A068996 Decimal expansion of 1 - 1/e.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A073230 Decimal expansion of (1/e)^e.

Views

Author

Keywords

Comments

Examples

References

Links