A163927 -id:A163927 - cp's OEIS frontend

A163931 Decimal expansion of the higher-order exponential integral E(x, m=2, n=1) at x=1.

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

Offset: 0

Johannes W. Meijer and Nico Baken, Aug 13 2009, Aug 17 2009

We define the higher-order exponential integrals by E(x,m,n) = x^(n-1)*Integral_{t=x..infinity} E(t,m-1,n)/t^n for m >= 1 and n >= 1 with E(x,m=0,n) = exp(-x), see Meijer and Baken.
The properties of the E(x,m,n) are analogous to those of the well-known exponential integrals E(x,m=1,n), see Abramowitz and Stegun and the formulas.
The series expansions of the higher-order exponential integrals are dominated by the constants alpha(k,n), see A163927, and gamma(k,n) = G(k,n), see A090998.
For information about the asymptotic expansion of the E(x,m,n) see A163932.
Values of E(x,m,n) can be evaluated with the Maple program.

			E(1,2,1) = 0.09784319721667017932553778904528008276958226953026576557442124245....

G. C. Greubel, Table of n, a(n) for n = 0..5000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, Chapter 5, pp. 227-251.
J. W. Meijer and N. H. G. Baken, The Exponential Integral Distribution, Statistics and Probability Letters, Volume 5, No.3, April 1987. pp 209-211.
M. S. Milgram, The generalized integro-exponential function, Math. of Computation, Vol. 44, pp. 443-458, 1985.
Eric Weisstein's World of Mathematics, The Exponential Integral.

Cf. A163927 (alpha(k,n)), A090998 (gamma(k,n) = G(k,n)), A163932.
Cf. A068985 (E(x=1,m=0,n) = exp(-1)) and A099285 (E(x=1,m=1,n=1)).
Cf. A001563 (n*n!), A002775 (n^2*n!), A091363 (n^3*n!) and A091364 (n^4*n!).

E:= proc(x,m,n) local nmax, kmax, EI, k1, k2, n1, n2; option remember: nmax:=20; kmax:=20; k1:=0: for n1 from 0 to nmax do alpha(k1,n1):=1 od: for k1 from 1 to kmax do for n1 from 1 to nmax do alpha(k1,n1) := (1/k1)*sum(sum(p^(-2*(k1-i1)),p=0..n1-1)*alpha(i1, n1),i1=0..k1-1) od; od: for n2 from 0 to kmax do G(0,n2):=1 od: for n2 from 1 to nmax do for k2 from 1 to kmax do G(k2,n2):=(1/k2)*(((gamma-sum(p^(-1),p=1..n2-1))*G(k2-1,n2)+ sum((Zeta(k2-i2)-sum(p^(-(k2-i2)), p=1..n2-1))*G(i2,n2),i2=0..k2-2))) od; od: EI:= evalf((-1)^m*((-x)^(n-1)/(n-1)!*sum(alpha(kz,n)*(G(m-2*kz,n)+sum(G(m-2*kz-i,n)*ln(x)^i/i!,i=1..m-2*kz)), kz=0..floor(m/2)) + sum((-x)^kx/((kx-n+1)^m*kx!),kx=0..n-2) + sum((-x)^ky/((ky-n+1)^m*ky!),ky=n..infinity))); return(EI): end:

Join[{0}, RealDigits[ N[ EulerGamma^2/2 + Pi^2/12 - HypergeometricPFQ[{1, 1, 1}, {2, 2, 2}, -1], 104]][[1]]] (* Jean-François Alcover, Nov 07 2012, from 1st formula *)

t=1; Euler^2/2 + Pi^2/12 + sumalt(k=1, t*=k; (-1)^k/(k^2*t)) \\ Charles R Greathouse IV, Nov 07 2016

E(x=1,m=2,n=1) = gamma^2/2 + Pi^2/12 + Sum_{k>=1} ((-1)^k/(k^2*k!)).
E(x=0,n,m) = (1/(n-1))^m for n >= 2.
Integral_{t=0..x} E(t,m,n) = 1/n^m - E(x,n,n+1).
dE(x,m,n+1)/dx = - E(x,m,n).
E(x,m,n+1) = (1/n)*(E(x,m-1,n+1) - x*E(x,m,n)).
E(x,m,n) = (-1)^m * ((-x)^(n-1)/(n-1)!) * Sum_{kz=0..floor(m/2)}(alpha (kz, n)*G(m-2*kz, n)) + (-1) ^m * ((-x)^(n-1)/(n-1)!) * Sum_{kz=0..floor(m/2)}(Sum_{i=1..m-2*kz}(alpha (kz, n) *G(m-2*kz-i, n)*log(x)^i/i!)) + (-1)^m * Sum_{ kx=0..n-2}((-x)^kx/((kx-n+1)^m*kx!) + (-1)^m * Sum_{ky>=n}((-x)^ky /(( ky-n+1)^m*ky!)).

A008955 Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.

Original entry on oeis.org

1, 1, 1, 1, 5, 4, 1, 14, 49, 36, 1, 30, 273, 820, 576, 1, 55, 1023, 7645, 21076, 14400, 1, 91, 3003, 44473, 296296, 773136, 518400, 1, 140, 7462, 191620, 2475473, 15291640, 38402064, 25401600, 1, 204, 16422, 669188, 14739153, 173721912, 1017067024, 2483133696, 1625702400

Offset: 0

N. J. A. Sloane

Discussion of Central Factorial Numbers by N. J. A. Sloane, Feb 01 2011: (Start)
Here is Riordan's definition of the central factorial numbers t(n,k) given in Combinatorial Identities, Section 6.5:
For n >= 0, expand the polynomial
x^[n] = x*Product{i=1..n-1} (x+n/2-i) = Sum_{k=0..n} t(n,k)*x^k.
The t(n,k) are not always integers. The cases n even and n odd are best handled separately.
For n=2m, we have:
x^[2m] = Product_{i=0..m-1} (x^2-i^2) = Sum_{k=1..m} t(2m,2k)*x^(2k).
E.g. x^[8] = x^2(x^2-1^2)(x^2-2^2)(x^2-3^2) = x^8-14x^6+49x^4-36x^2,
which corresponds to row 4 of the present triangle.
So the m-th row of the present triangle gives the absolute values of the coefficients in the expansion of Product_{i=0..m-1} (x^2-i^2).
Equivalently, and simpler, the n-th row gives the coefficients in the expansion of Product_{i=1..n-1}(x+i^2), highest powers first.
For n odd, n=2m+1, we have:
x^[2m+1] = x*Product_{i=0..m-1}(x^2-((2i+1)/2)^2) = Sum_{k=0..m} t(2m+1,2k+1)*x^(2k+1).
E.g. x^[5] = x(x^2-(1/2)^2)(x^2-(3/2)^2) = x^5-10x^3/4+9x/16,
which corresponds to row 2 of the triangle in A008956.
We now rescale to get integers by replacing x by x/2 and multiplying by 2^(2m+1) (getting 1, -10, 9 from the example).
The result is that row m of triangle A008956 gives the coefficients in the expansion of x*Product_{i=0..m} (x^2-(2i+1)^2).
Equivalently, and simpler, the n-th row of A008956 gives the coefficients in the expansion of Product_{i=0..n-1} (x+(2i+1)^2), highest powers first.
Note that the n-th row of A182867 gives the coefficients in the expansion of Product_{i=1..n} (x+(2i)^2), highest powers first.
(End)
Contribution from Johannes W. Meijer, Jun 18 2009: (Start)
We define Beta(n-z,n+z)/Beta(n,n) = Gamma(n-z)*Gamma(n+z)/Gamma(n)^2 = sum(EG2[2m,n]*z^(2m), m = 0..infinity) with Beta(z,w) the Beta function. The EG2[2m,n] coefficients are quite interesting, see A161739. Our definition leads to EG2[2m,1] = 2*eta(2m) and the recurrence relation EG2[2m,n] = EG2[2m,n-1] - EG2[2m-2,n-1]/(n-1)^2 for m = -2, -1, 0, 1, 2, ... and n = 2, 3, ... , with eta(m) = (1-2^(1-m))*zeta(m) with eta(m) the Dirichlet eta function and zeta(m) the Riemann zeta function. We found for the matrix coefficients EG2[2m,n] = sum((-1)^(k+n)*t1(n-1,k-1)*2*eta(2*m-2*n+2*k)/((n-1)!)^2,k=1..n) with the central factorial numbers t1(n,m) as defined above, see also the Maple program.
From the EG2 matrix we arrive at the ZG2 matrix, see A161739 for its odd counterpart, which is defined by ZG2[2m,1] = 2*zeta(2m) and the recurrence relation ZG2[2m,n] = ZG2[2m-2,n-1]/(n*(n-1))-(n-1)*ZG2[2m,n-1]/n for m = -2, -1, 0, 1, 2, ... and n = 2, 3, ... . We found for the ZG2[2m,n] = Sum_{k=1..n} (-1)^(k+1)*t1(n-1,k-1)* 2* zeta(2*m-2*n+2*k)/((n-1)!*(n)!), and we see that the central factorial numbers t1(n,m) once again play a crucial role.
(End)

			Triangle begins:
  1;
  1,   1;
  1,   5,   4;
  1,  14,  49,  36;
  1,  30, 273, 820, 576;
  ...

B. C. Berndt, Ramanujan's Notebooks Part 1, Springer-Verlag 1985.
J. Riordan, Combinatorial Identities, Wiley, 1968, p. 217.

Alois P. Heinz, Rows n = 0..100, flattened (first 51 rows from T. D. Noe)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, Chapter 23, pp. 811-812.
R. H. Boels, Three particle superstring amplitudes with massive legs, arXiv preprint arXiv:1201.2655 [hep-th], 2012.
R. H. Boels and T. Hansen, String theory in target space, arXiv preprint arXiv:1402.6356 [hep-th], 2014.
P. L. Butzer, M. Schmidt, E. L. Stark and L. Vogt, Central Factorial Numbers: Their main properties and some applications, Numerical Functional Analysis and Optimization, 10 (5&6), 419-488 (1989).
M. W. Coffey and M. C. Lettington, On Fibonacci Polynomial Expressions for Sums of mth Powers, their implications for Faulhaber's Formula and some Theorems of Fermat, arXiv:1510.05402 [math.NT], 2015.
T. L. Curtright and T. S. Van Kortryk, On Rotations as Spin Matrix Polynomials, arxiv:1408.0767 [math-ph], 2014.
P. A. MacMahon, Divisors of numbers and their continuations in the theory of partitions, Proc. London Math. Soc., 19 (1919), 75-113; Coll. Papers II, pp. 303-341.
Toshiki Matsusaka, Applications of Faà di Bruno's formula to partition traces, arXiv:2507.00404 [math.NT], 2025. See p. 5.
J. W. Meijer and N. H. G. Baken, The Exponential Integral Distribution, Statistics and Probability Letters, Volume 5, No.3, April 1987. pp 209-211.
Mircea Merca, A Special Case of the Generalized Girard-Waring Formula, J. Integer Sequences, Vol. 15 (2012), Article 12.5.7.
S. Shadrin, L. Spitz, and D. Zvonkine, On double Hurwitz numbers with completed cycles, J. Lond. Math. Soc., II. Ser. 86, No. 2, 407-432 (2012), Corollary 7.5.

Cf. A036969.
Columns include A000330, A000596, A000597. Right-hand columns include A001044, A001819, A001820, A001821. Row sums are in A101686.
Appears in A160464 (Eta triangle), A160474 (Zeta triangle), A160479 (ZL(n)), A161739 (RSEG2 triangle), A161742, A161743, A002195, A002196, A162440 (EG1 matrix), A162446 (ZG1 matrix) and A163927. - Johannes W. Meijer, Jun 18 2009, Jul 06 2009 and Aug 17 2009
Cf. A234324 (central terms).

T:= function(n,k)
    if k=0 then return 1;
    elif k=n then return (Factorial(n))^2;
    else return n^2*T(n-1,k-1) + T(n-1,k);
    fi;
  end;
Flat(List([0..8], n-> List([0..n], k-> T(n,k) ))); # G. C. Greubel, Sep 14 2019

a008955 n k = a008955_tabl !! n !! k
a008955_row n = a008955_tabl !! n
a008955_tabl = [1] : f [1] 1 1 where
   f xs u t = ys : f ys v (t * v) where
     ys = zipWith (+) (xs ++ [t^2]) ([0] ++ map (* u^2) (init xs) ++ [0])
     v = u + 1
-- Reinhard Zumkeller, Dec 24 2013

T:= func< n,k | Factorial(2*(n+1))*(&+[(-1)^j*Binomial(n,k-j)*(&+[2^(m-2*k)*StirlingFirst(2*(n-k+1)+m, 2*(n-k+1))*Binomial(2*(n-k+1)+2*j-1, 2*(n-k+1)+m-1)/Factorial(2*(n-k+1)+m): m in [0..2*j]]): j in [0..k]]) >;
[T(n,k): k in [0..n], n in [0..8]]; // G. C. Greubel, Sep 14 2019

nmax:=7: for n from 0 to nmax do t1(n, 0):=1: t1(n, n):=(n!)^2 end do: for n from 1 to nmax do for k from 1 to n-1 do t1(n, k) := t1(n-1, k-1)*n^2 + t1(n-1, k) end do: end do: seq(seq(t1(n, k), k=0..n), n=0..nmax); # Johannes W. Meijer, Jun 18 2009, Revised Sep 16 2012
t1 := proc(n,k)
        sum((-1)^j*stirling1(n+1,n+1-k+j)*stirling1(n+1,n+1-k-j),j=-k..k) ;
end proc: # Mircea Merca, Apr 02 2012
# third Maple program:
T:= proc(n, k) option remember; `if`(k=0, 1,
      add(T(j-1, k-1)*j^2, j=1..n))
    end:
seq(seq(T(n, k), k=0..n), n=0..8);  # Alois P. Heinz, Feb 19 2022

t[n_, 0]=1; t[n_, n_]=(n!)^2; t[n_ , k_ ]:=t[n, k] = n^2*t[n-1, k-1] + t[n-1, k]; Flatten[Table[t[n, k], {n,0,8}, {k,0,n}] ][[1 ;; 42]]
(* Jean-François Alcover, May 30 2011, after recurrence formula *)

T(n,m):=(2*(n+1))!*sum((-1)^k*binomial(n,m-k)*sum((2^(i-2*m)*stirling1(2*(n-m+1)+i,2*(n-m+1))*binomial(2*(n-m+1)+2*k-1,2*(n-m+1)+i-1))/(2*(n-m+1)+i)!,i,0,2*k),k,0,m); /* Vladimir Kruchinin, Oct 05 2013 */

T(n,k)=if(k==0,1, if(k==n, (n!)^2, n^2*T(n-1, k-1) + T(n-1, k)));
for(n=0,8, for(k=0,n, print1(T(n,k), ", "))) \\ G. C. Greubel, Sep 14 2019

# This triangle is (0,0)-based.
def A008955(n, k) :
    if k==0 : return 1
    if k==n : return factorial(n)^2
    return n^2*A008955(n-1, k-1) + A008955(n-1, k)
for n in (0..7) : print([A008955(n, k) for k in (0..n)]) # Peter Luschny, Feb 04 2012

The n-th row gives the coefficients in the expansion of Product_{i=1..n-1}(x+i^2), highest powers first (see Comments section).
The triangle can be obtained from the recurrence t1(n,k) = n^2*t1(n-1,k-1) + t1(n-1,k) with t1(n,0) = 1 and t1(n,n) = (n!)^2.
t1(n,k) = Sum_{j=-k..k} (-1)^j*s(n+1,n+1-k+j)*s(n+1,n+1-k-j) = Sum_{j=0..2*(n+1-k)} (-1)^(n+1-k+j)*s(n+1,j)*s(n+1,2*(n+1-k)-j), where s(n,k) are Stirling numbers of the first kind, A048994. - Mircea Merca, Apr 02 2012
E.g.f.: cosh(2/sqrt(t)*asin(sqrt(t)*z/2)) = 1 + z^2/2! + (1 + t)*z^4/4! + (1 + 5*t + 4*t^2)*z^6/6! + ... (see Berndt, p.263 and p.306). - Peter Bala, Aug 29 2012
T(n,m) = (2*(n+1))!*Sum_{k=0..m} ((-1)^k*binomial(n,m-k)*Sum_{i=0..2*k} ((2^(i-2*m)*stirling1(2*(n-m+1)+i,2*(n-m+1))*binomial(2*(n-m+1)+2*k-1, 2*(n-m+1)+i-1))/(2*(n-m+1)+i)!)). - Vladimir Kruchinin, Oct 05 2013

There's an error in the last column of Riordan's table (change 46076 to 21076).
More terms from Vladeta Jovovic, Apr 16 2000
Link added and cross-references edited by Johannes W. Meijer, Aug 17 2009
Discussion of Riordan's definition of central factorial numbers added by N. J. A. Sloane, Feb 01 2011

A090998 Decimal expansion of lim_{k -> +-oo} k^2*(1 - Gamma(1+i/k)) where i^2 = -1 and Gamma is the Gamma function.

Original entry on oeis.org

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

Offset: 0

Benoit Cloitre, Feb 29 2004

Limit_{k->oo} k*(1-Gamma(1+1/k)) = -Gamma'(1) = gamma = 0.577....

Decimal expansion of the higher-order exponential integral constant gamma(2,1). The higher-order exponential integrals, see A163931, are defined by E(x,m,n) = x^(n-1)*Integral_{t=x..oo} (E(t,m-1,n)/t^n) dt for m >= 1 and n >= 1, with E(x,m=0,n) = exp(-x). The series expansions of the higher-order exponential integrals are dominated by the gamma(k,n) and the alpha(k,n) constants, see A163927. - Johannes W. Meijer and Nico Baken, Aug 13 2009

			G(2,1) = 0.9890559953279725553953956515...

G. C. Greubel, Table of n, a(n) for n = 0..10000
J. W. Meijer and N. H. G. Baken, The Exponential Integral Distribution, Statistics and Probability Letters, Volume 5, No. 3, April 1987, pp. 209-211.

Cf. A163931 (E(x,m,n)), A163927 (alpha(k,n)), A001620 (gamma).
The structure of the G(k,n=1) formulas lead (replace gamma with G and Zeta with Z) to A036039. - Johannes W. Meijer and Nico Baken, Aug 13 2009
Cf. A081855.

SetDefaultRealField(RealField(100)); R:= RealField(); (6*EulerGamma(R)^2 + Pi(R)^2)/12; // G. C. Greubel, Feb 01 2019

ncol:=1; nmax:=5; kmax:=nmax; for n from 1 to nmax do G(0,n):=1 od: for n from 1 to nmax do for k from 1 to kmax do G(k,n):= expand((1/k)*((gamma-sum(p^(-1),p=1..n-1))* G(k-1,n)+sum((Zeta(k-i)-sum(p^(-(k-i)),p=1..n-1))*G(i,n),i=0..k-2))) od; od: for k from 0 to kmax do G(k,ncol):=G(k,ncol) od; # Johannes W. Meijer and Nico Baken, Aug 13 2009

RealDigits[(6*EulerGamma^2 + Pi^2)/12, 10, 104][[1]] (* Jean-François Alcover, Mar 04 2013 *)

default(realprecision, 100); (6*Euler^2 +Pi^2)/12 \\ G. C. Greubel, Feb 01 2019

numerical_approx((6*euler_gamma^2 + pi^2)/12, digits=100) # G. C. Greubel, Feb 01 2019

From Johannes W. Meijer and Nico Baken, Aug 13 2009: (Start)
G(2,1) = gamma(2,1) = gamma^2/2 + Pi^2/12.
G(k,n) = (1/k)*(gamma*G(k-1,n)) - (1/k)*Sum_{p=1..n-1} (p^(-1))* G(k-1,n) + (1/k) * Sum_{i=0..k-2} (Zeta(k-i) * G(i,n))  - (1/k)*Sum_{i=0..k-2}(Sum_{p=1..n-1} (p^(i-k)) * G(i,n)) with G(0,n) = 1 for k >= 0 and n >= 1.
G(k,n+1) = G(k,n) - G(k-1,n)/n.
GF(z,n) = GAMMA(n-z)/GAMMA(n).
(gamma - G(1,n)) = A001008(n-1)/A002805(n-1) for n >= 2. (End)
Equals A081855/2. - Hugo Pfoertner, Mar 12 2024

A163928 Numerators of the higher order exponential integral constants alpha(2,n).

Original entry on oeis.org

0, 1, 21, 1897, 32197, 20881861, 7139587, 17462165587, 283355376967, 69621962857381, 70246946681461, 1036088178214798501, 1042504974775473001, 29931734181763981573561, 4295332813075795410223, 4312254507400142830831

Offset: 1

Johannes W. Meijer & Nico Baken, Aug 13 2009, Aug 17 2009

See A163927 for information about the alpha(k,n) constants.

Apart from a difference of offset, alpha(2,n) appears to be the multiple harmonic (star) sum Sum_{j = 1..n} 1/j^2 Sum_{k = 1..j} 1/k^2, which has the initial values [1, 21/16, 1897/1296, 32197/20736, 20881861/12960000, 7139587/4320000, ...]. - Peter Bala, Jan 31 2019

			alpha(k=2,n=1) = 0, alpha(k=2,2) = 1, alpha(k=2,3) = 21/16, alpha(k=2,4) = 1897/1296.

Cf. A163929 (denominators).
Cf. A163927 (alpha(k,n)) and A090998 (gamma(k,n)).
Cf. A007406, A007407.

nmax:=17; rowk:=2; kmax:=nmax: k:=0: for n from 1 to nmax do alpha(k,n):=1 od: for k from 1 to kmax do for n from 1 to nmax do alpha(k,n) := (1/k)*sum(sum(p^(-2*(k-i)),p=0..n-1)*alpha(i, n),i=0..k-1) od; od: seq(alpha(rowk, n),n=1..nmax);

alpha(k,n) = (1/k)*Sum_{i=0..k-1} (Sum_{p=0..n-1} p^(-2*(k-i))*alpha(i, n) with alpha(0,n) = 1, with k = 2 and n >= 1. alpha(1,n) = A007406(n-1)/A007407(n-1) for n >= 2.

A163929 Denominators of the higher order exponential integral constants alpha(2,n).

Original entry on oeis.org

1, 1, 16, 1296, 20736, 12960000, 4320000, 10372320000, 165957120000, 40327580160000, 40327580160000, 590436101122560000, 590436101122560000, 16863445484161436160000, 2409063640594490880000, 2409063640594490880000

Offset: 1

Johannes W. Meijer & Nico Baken, Aug 13 2009, Aug 17 2009

See A163927 for information about the constants alpha(k,n).

			alpha(k=2, n=1) = 0, alpha(k=2, 2) = 1, alpha(k=2, 3) = 21/16, and alpha(k=2, 4) = 1897/1296.

Cf. A163928 (numerators).

alpha(k,n) = (1/k)*Sum_{i=0..k-1} Sum_{p=0..n-1} p^(-2*(k-i))*alpha(i, n) with alpha(0,n) = 1. For this sequence, k = 2 and n >= 1.

A163930 Duplicate of A090998.

Original entry on oeis.org

Offset: 0

Johannes W. Meijer and Nico Baken, Aug 13 2009, Aug 17 2009

dead

The higher order exponential integrals, see A163931, are defined by E(x,m,n) = x^(n-1)*int(E(t,m-1,n)/t^n, t=x..infinity) for m>=1 and n>=1, with E(x,m=0,n) = exp(-x).
The series expansions of the higher order exponential integrals are dominated by the gamma(k,n) and the alpha(k,n) constants, see A163927.
The values of the gamma(k,n) = G(k,n) coefficients can be determined with the Maple program.

			G(2,1) = 0.9890559953279725553953956515...

G. C. Greubel, Table of n, a(n) for n = 0..5000
J. W. Meijer and N. H. G. Baken, The Exponential Integral Distribution, Statistics and Probability Letters, Volume 5, No.3, April 1987. pp 209-211.

Cf. A163931 (E(x,m,n)), A163927 (alpha(k,n)).
G(1,1) equals A001620 (gamma).
(gamma - G(1,n)) equals A001008(n-1)/A002805(n-1) for n>=2.
The structure of the G(k,n=1) formulas lead (replace gamma by G and Zeta by Z) to A036039.

ncol:=1; nmax:=5; kmax:=nmax; for n from 1 to nmax do G(0,n):=1 od: for n from 1 to nmax do for k from 1 to kmax do G(k,n):= expand((1/k)*((gamma-sum(p^(-1),p=1..n-1))* G(k-1,n)+sum((Zeta(k-i)-sum(p^(-(k-i)),p=1..n-1))*G(i,n),i=0..k-2))) od; od: for k from 0 to kmax do G(k,ncol):=G(k,ncol) od;

RealDigits[ N[ EulerGamma^2/2 + Pi^2/12, 105]][[1]] (* Jean-François Alcover, Nov 07 2012, from 1st formula *)

G(2,1) = gamma(2,1) = gamma^2/2+Pi^2/12.
G(k,n) = (1/k)*(gamma*G(k-1,n)) - (1/k)*Sum_{p=1..n-1}(p^(-1))* G(k-1,n) + (1/k)* Sum_{i=0..k-2}(Zeta(k-i) * G(i,n))  - (1/k)*Sum_{i=0..k-2}(Sum_{p=1..n-1}(p^(i-k)) * G(i,n)) with G(0,n) = 1 for k>=0 and n>=1.
G(k,n+1) = G(k,n) -G(k-1,n)/n.
GF(z,n) = GAMMA(n-z)/GAMMA(n).

cp's OEIS Frontend

A163931 Decimal expansion of the higher-order exponential integral E(x, m=2, n=1) at x=1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A008955 Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Sage

Formula

Extensions

A090998 Decimal expansion of lim_{k -> +-oo} k^2*(1 - Gamma(1+i/k)) where i^2 = -1 and Gamma is the Gamma function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A163928 Numerators of the higher order exponential integral constants alpha(2,n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Formula

A163929 Denominators of the higher order exponential integral constants alpha(2,n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A163930 Duplicate of A090998.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula