OFFSET
0,5
COMMENTS
These polynomials p(n, x) appear in the W. Lang reference as c1(-(n+1);x), n >= 0 on p.12. The coefficients are given there in eq.(44) on p. 6. - Wolfdieter Lang, Nov 20 2015
LINKS
W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
FORMULA
a(n, m) = A033842(n, n-m) = binomial(n+1, m+1)*(n+1)^{m-1}, n >= m >= 0, else 0.
p(k-1, -x)/(1-k*x)^k =(-1+1/(1-k*x)^k)/(x*k^2) is for k=1..5 G.f. for A000012, A001792, A036068, A036070, A036083, respectively.
From Werner Schulte, Oct 19 2015: (Start)
a(2*n,n) = A000108(n)*(2*n+1)^n;
a(3*n,2*n) = A001764(n)*(3*n+1)^(2*n);
a(p*n,(p-1)*n) = binomial(p*n,n)/((p-1)*n+1)*(p*n+1)^((p-1)*n) for p > 0;
Sum_{m=0..n} (m+1)*a(n,m) = (n+2)^n;
Sum_{m=0..n} (-1)^m*(m+1)*a(n,m) = (-n)^n where 0^0 = 1;
p(n,x) = Sum_{m=0..n} a(n,m)*x^m = ((1+(n+1)*x)^(n+1)-1)/((n+1)^2*x).
(End)
EXAMPLE
The triangle a(n, m) begins:
n\m 0 1 2 3 4 5 6 7 ...
0: 1
1: 1 1
2: 1 3 3
3: 1 6 16 16
4: 1 10 50 125 125
5: 1 15 120 540 1296 1296
6: 1 21 245 1715 7203 16807 16807
7: 1 28 448 4480 28672 114688 262144 262144
... reformatted. - Wolfdieter Lang, Nov 20 2015
E.g. the third row {1,3,3} corresponds to polynomial p(2,x)= 1 + 3*x + 3*x^2.
MAPLE
seq(seq(binomial(n+1, m+1)*(n+1)^(m-1), m=0..n), n=0..10); # Robert Israel, Oct 19 2015
MATHEMATICA
Table[Binomial[n + 1, k + 1] (n + 1)^(k - 1), {n, 0, 9}, {k, 0, n}] // Flatten (* Michael De Vlieger, Nov 19 2015 *)
PROG
(Magma) /* As triangle: */ [[Binomial(n+1, k+1)*(n+1)^(k-1): k in [0..n]]: n in [0.. 15]]; // Vincenzo Librandi, Nov 20 2015
CROSSREFS
a(n, 0)= A000012 (powers of 1), a(n, 1)= A000217 (triangular numbers), a(n, n)= A000272(n+1), n >= 0 (diagonal), a(n, n-1)= A000272(n+1), n >= 1.
KEYWORD
AUTHOR
STATUS
approved