This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A165674 Triangle generated by the asymptotic expansions of the E(x,m=2,n). 13
 1, 3, 1, 11, 5, 1, 50, 26, 7, 1, 274, 154, 47, 9, 1, 1764, 1044, 342, 74, 11, 1, 13068, 8028, 2754, 638, 107, 13, 1, 109584, 69264, 24552, 5944, 1066, 146, 15, 1, 1026576, 663696, 241128, 60216, 11274, 1650, 191, 17, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The higher order exponential integrals E(x,m,n) are defined in A163931. The asymptotic expansion of the E(x,m=2,n) ~ (exp(-x)/x^2)*(1 - (1+2*n)/x + (2+6*n+3*n^2)/x^2 - (6+22*n+18*n^2+ 4*n^3)/x^3 + ... ) is discussed in A028421. The formula for the asymptotic expansion leads for n = 1, 2, 3, .., to the left hand columns of the triangle given above. The recurrence relations of the right hand columns of this triangle lead to Pascal's triangle A007318, their a(n) formulas lead to Wiggen's triangle A028421 and their o.g.f.s lead to Wood's polynomials A126671; cf. A080663, A165676, A165677, A165678 and A165679. The row sums of this triangle lead to A093344. Surprisingly the e.g.f. of the row sums Egf(x) = (exp(1)*Ei(1,1-x) - exp(1)*Ei(1,1))/(1-x) leads to the exponential integrals in view of the fact that E(x,m=1,n=1) = Ei(n=1,x). We point out that exp(1)*Ei(1,1) = A073003. The Maple programs generate the coefficients of the triangle given above. The first one makes use of a relation between the triangle coefficients, see the formulas, and the second one makes use of the asymptotic expansions of the E(x,m=2,n). Amarnath Murthy discovered triangle A093905 which is the reversal of our triangle. A165675 is an extended version of this triangle. Its reversal is A105954. Triangle A094587 is generated by the asymptotic expansions of E(x,m=1,n). LINKS FORMULA a(n,m) = (n-m+1)*a(n-1,m) + a(n-1,m-1), for 2 <= m <= n-1, with a(n,n) = 1 and a(n,1) = n*a(n-1,1) + (n-1)!. a(n,m) = product(i, i= m..n)*sum(1/i, i = m..n). MAPLE nmax:=9; for n from 1 to nmax do a(n, n) := 1 od: for n from 2 to nmax do a(n, 1) := n*a(n-1, 1) + (n-1)! od: for n from 3 to nmax do for m from 2 to n-1 do a(n, m) := (n-m+1)*a(n-1, m) + a(n-1, m-1) od: od: seq(seq(a(n, m), m = 1..n), n = 1..nmax); # End program 1 nmax := nmax+1: m:=2; with(combinat): EA := proc(x, m, n) local E, i; E:=0: for i from m-1 to nmax+2 do E := E + sum((-1)^(m+k1+1) * binomial(k1, m-1) * n^(k1-m+1) * stirling1(i, k1), k1=m-1..i) / x^(i-m+1) od: E:= exp(-x)/x^(m) * E: return(E); end: for n1 from 1 to nmax do f(n1-1) := simplify(exp(x) * x^(nmax+3) * EA(x, m, n1)); for m1 from 0 to nmax+2 do b(n1-1, m1) := coeff(f(n1-1), x, nmax+2-m1) od: od: for n1 from 0 to nmax-1 do for m1 from 0 to n1-m+1 do a(n1-m+2, m1+1) := abs(b(m1, n1-m1)) od: od: seq(seq(a(n, m), m = 1..n), n = 1..nmax-1); # End program 2 # Maple programs revised by Johannes W. Meijer, Sep 22 2012 CROSSREFS A093905 is the reversal of this triangle. A000254, A001705, A001711, A001716, A001721, A051524, A051545, A051560, A051562, A051564 are the first ten left hand columns. A080663, n>=2, is the third right hand column. A165676, A165677, A165678 and A165679 are the next right hand columns, A093344 gives the row sums. A073003 is Gompertz's constant. A094587 is generated by the asymptotic expansions of E(x, m=1, n). Cf. A165675, A105954 (Quet) and A067176 (Bottomley). Cf. A007318 (Pascal), A028421 (Wiggen), A126671 (Wood). Sequence in context: A120291 A099001 A119947 * A027446 A027516 A092808 Adjacent sequences:  A165671 A165672 A165673 * A165675 A165676 A165677 KEYWORD easy,nonn,tabl AUTHOR Johannes W. Meijer, Oct 05 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 20 02:34 EST 2019. Contains 329323 sequences. (Running on oeis4.)