OFFSET
0,3
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..400
H. W. Gould, Harris Kwong, Jocelyn Quaintance, On Certain Sums of Stirling Numbers with Binomial Coefficients, J. Integer Sequences, 18 (2015), #15.9.6.
MAPLE
a:= n-> (m-> add((-1)^k*binomial(2*n+m, n-k)
*combinat[stirling1](n+k, k), k=0..n))(-2):
seq(a(n), n=0..20); # Alois P. Heinz, Sep 06 2015
# second Maple program:
a:= proc(n) option remember; `if`(n<2, 1, ((2*n-3)*
(4*n^3+9*n^2-n-3)*a(n-1))/(4*n^3-3*n^2-7*n+3))
end:
seq(a(n), n=0..20); # Alois P. Heinz, Sep 06 2015
MATHEMATICA
a[n_] := Sum[(-1)^k Binomial[2n-2, n-k] StirlingS1[n+k, k], {k, 0, n}]; Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Mar 18 2017 *)
PROG
(PARI) a(n) = sum(k=0, n, (-1)^k*binomial(2*n-2, n-k)*stirling(n+k, k, 1)); \\ Michel Marcus, Mar 18 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 06 2015
EXTENSIONS
More terms from Alois P. Heinz, Sep 06 2015
STATUS
approved