|
|
A001716
|
|
Generalized Stirling numbers.
(Formerly M4651 N1990)
|
|
21
|
|
|
1, 9, 74, 638, 5944, 60216, 662640, 7893840, 101378880, 1397759040, 20606463360, 323626665600, 5395972377600, 95218662067200, 1773217155225600, 34758188233574400, 715437948072960000, 15429680577561600000, 347968129734973440000, 8190600438533990400000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The asymptotic expansion of the higher order exponential integral E(x,m=2,n=4) ~ exp(-x)/x^2*(1 - 9/x + 74/x^2 - 638/x^3 + 5944/x^4 - 60216/x^5 + 662640/x^6 - ...) leads to the sequence given above. See A163931 and A028421 for more information. - Johannes W. Meijer, Oct 20 2009
For nonnegative integers n, m and complex numbers a, b (with b <> 0), the numbers R_n^m(a,b) were introduced by Mitrinovic (1961) and Mitrinovic and Mitrinovic (1962) using slightly different notation.
These numbers are defined via the g.f. Product_{r=0..n-1} (x - (a + b*r)) = Sum_{m=0..n} R_n^m(a,b)*x^m for n >= 0.
As a result, R_n^m(a,b) = R_{n-1}^{m-1}(a,b) - (a + b*(n-1))*R_{n-1}^m(a,b) for n >= m >= 1 with R_0^0(a,b) = 1, R_1^0(a,b) = a, R_1^1(a,b) = 1, and R_n^m(a,b) = 0 for n < m.
With a = 0 and b = 1, we get the Stirling numbers of the first kind S1(n,m) = R_n^m(a=0, b=1) = A048994(n,m) for n, m >= 0.
We have R_n^m(a,b) = Sum_{k=0}^{n-m} (-1)^k * a^k * b^(n-m-k) * binomial(m+k, k) * S1(n, m+k) for n >= m >= 0.
For the current sequence, a(n) = R_{n+1}^1(a=-4, b=-1) for n >= 0. (End)
|
|
REFERENCES
|
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).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{k=0..n} (-1)^(n+k) * (k+1) * 4^k * stirling1(n+1, k+1). - Borislav Crstici (bcrstici(AT)etv.utt.ro), Jan 26 2004
a(n)= n! * [3]h(n), where [k]h(n) denotes the k-th successive summation of the harmonic numbers from 0 to n (with offset 1). [Gary Detlefs, Jan 04 2011]
a(n) = (n+1)! * Sum_{k=0..n} (-1)^k*binomial(-4,k)/(n+1-k). [Gary Detlefs, Jul 16 2011]
a(n) = (n+4)! * Sum_{k=1..n+1} 1/(k+3)/6. [Gary Detlefs, Sep 14 2011]
E.g.f. (for offset 1): 1/(1-x)^4 * log(1/(1-x)). - Vaclav Kotesovec, Jan 19 2014
a(n) = [x] Product_{r=0..n} (x + 4 + r) = (Product_{r=0..n} (4 + r)) * Sum_{i=0..n} 1/(4 + i).
Since a(n) = R_{n+1}^1(a=-4, b=-1) and R_n^m(a,b) = R_{n-1}^{m-1}(a,b) - (a + b*(n-1))*R_{n-1}^m(a,b), we conclude that:
(i) a(n) = (n+3)!/6 + (n+4)*a(n-1) for n >= 1;
(ii) a(n) = (2*n+7)*a(n-1) - (n+3)^2*a(n-2) for n >= 2. (End)
|
|
MATHEMATICA
|
f[k_] := k + 3; t[n_] := Table[f[k], {k, 1, n}]; a[n_] := SymmetricPolynomial[n - 1, t[n]]; Table[a[n], {n, 1, 16}] (* Clark Kimberling, Dec 29 2011 *)
Rest[CoefficientList[Series[(1-x)^(-4)*Log[1/(1-x)], {x, 0, 20}], x]*Range[0, 20]!] (* Vaclav Kotesovec, Jan 19 2014 *)
|
|
PROG
|
(PARI) R(n, m, a, b) = sum(k=0, n-m, (-1)^k*a^k*b^(n-m-k)*binomial(m+k, k)*stirling(n, m+k, 1));
aa(n) = R(n+1, 1, -4, -1);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Borislav Crstici (bcrstici(AT)etv.utt.ro), Jan 26 2004
|
|
STATUS
|
approved
|
|
|
|