A001706 Generalized Stirling numbers.
1, 9, 71, 580, 5104, 48860, 509004, 5753736, 70290936, 924118272, 13020978816, 195869441664, 3134328981120, 53180752331520, 953884282141440, 18037635241029120, 358689683932346880, 7483713725055744000, 163478034254755584000, 3731670622213083648000
Offset: 0
Keywords
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
- T. D. Noe, Table of n, a(n) for n = 0..100
- D. S. Mitrinovic and R. S. Mitrinovic, Tableaux d'une classe de nombres reliƩs aux nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. No. 77 1962, 77 pp.
- Robert E. Moritz, On the sum of products of n consecutive integers, Univ. Washington Publications in Math., 1 (No. 3, 1926), 44-49 [Annotated scanned copy]
Programs
-
Mathematica
Table[-Coefficient[CharacteristicPolynomial[Array[KroneckerDelta[#1,#2]((((#1+3)))-1)+1&,{n,n}],x],x,1],{n,1,10}] (* John M. Campbell, May 24 2011 *)
Formula
E.g.f. (with offset 2): log(1 - x)^2 / (2 * (1 - x)^2).
a(n) = Sum_{k=0..n}(-1)^(n+k)*binomial(k+2, 2)*2^k*stirling1(n+2, k+2). - Borislav Crstici (bcrstici(AT)etv.utt.ro), Jan 26 2004
If we define f(n,i,a)=sum(binomial(n,k)*stirling1(n-k,i)*product(-a-j,j=0..k-1),k=0..n-i), then a(n-1) = |f(n,2,2)|, for n>=2. - Milan Janjic, Dec 21 2008
a(n) = (n+3)!*((gamma-1)*Psi(n+4)+2+gamma^2-17*gamma/6+sum(Psi(i+4)/(i+4),i = 0 .. n-1)). - Mark van Hoeij, Oct 26 2011
Extensions
More terms from Christian G. Bower
Comments