

A134991


Triangle of Ward numbers T(n,k) read by rows.


18



1, 1, 3, 1, 10, 15, 1, 25, 105, 105, 1, 56, 490, 1260, 945, 1, 119, 1918, 9450, 17325, 10395, 1, 246, 6825, 56980, 190575, 270270, 135135, 1, 501, 22935, 302995, 1636635, 4099095, 4729725, 2027025, 1, 1012, 74316, 1487200, 12122110, 47507460
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

This is a reordered version of A008299 read along the diagonals (see table on p. 222 in Comtet) and a rowreversed version of a table on p. 92 in the Ward reference (and A181996, with an additional leading 1). A134685 is a refinement of the Ward table. The first and second diagonals are A001147 and A000457 and appear in the diagonals of several OEIS entries. The polynomials also appear in Carlitz (p. 85), Drake et al. (p. 8) and Smiley (p. 7).
First few polynomials (with a different offset) are
P(0,t) = 0
P(1,t) = 1
P(2,t) = t
P(3,t) = t + 3 t^2
P(4,t) = t + 10 t^2 + 15 t^3
P(5,t) = t + 25 t^2 + 105 t^3 + 105 t^4
These are the "face" numbers of the tropical Grassmannian G(2,n),related to phylogenetic trees (with offset 0 beginning with P(2,t)). Corresponding hvectors are A008517.  Tom Copeland, Oct 03 2011
A133314 applied to the derivative of A(x,t) implies (a.+b.)^n = 0^n , for (b_n)=P(n+1,t) and (a_0)=1, (a_1)=t, and (a_n)=(1+t) P(n,t) otherwise. E.g., umbrally, (a.+b.)^2 = a_2*b_0 + 2 a_1*b_1 + a_0*b_2 =0.  Tom Copeland, Oct 08 2011


REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974.
G. Gaiffi, Nested sets, set partitions and KirkmanCayley dissection numbers, arXiv preprint arXiv:1404.3395, 2014


LINKS

Table of n, a(n) for n=1..42.
J. Fernando Barbero G., Jesús Salas, Eduardo J. S. Villaseñor, Bivariate Generating Functions for a Class of Linear Recurrences. I. General Structure, arXiv:1307.2010, 2013
J. F. Barbero G., J. Salas and E. J. S. Villaseñor, Bivariate Generating Functions for a Class of Linear Recurrences. II. Applications, arXiv preprint arXiv:1307.5624, 2013
A. Blass, N. Dobrinen, D. Raghavan, The next best thing to a Ppoint, arXiv preprint arXiv:1308.3790, 2013
L. Carlitz, The coefficients in an asymptotic expansion and certain related numbers, Duke Math. J., vol 35 (1968), p. 8390.
Lane Clark, Asymptotic normality of the Ward numbers, Discrete Math. 203 (1999), no. 13, 4148. [From N. J. A. Sloane, Feb 06 2012]
Brian Drake, Ira M. Gessel, and Guoce Xin, Three Proofs and a Generalization of the GouldenLitsynShevelev Conjecture on a Sequence Arising in Algebraic Geometry, J. of Integer Sequences, Vol. 10 (2007), Article 07.3.7
MathOverflow, Face numbers for tropical Grassmannian G'_2,7 simplicial complex?
L. M. Smiley, Completion of a Rational Function Sequence of Carlitz
M. Ward, The representations of Stirling's numbers and Stirling's polynomials as sums of factorials, Amer. J. Math., 56 (1934), p. 8795.


FORMULA

E.g.f. for the polynomials is A(x,t) = (xt)/(t+1) + T{ (t/(t+1)) * exp[(xt)/(t+1)] }, where T(x) is the Tree function, the e.g.f. of A000169. The compositional inverse in x (about x = 0) is B(x) = x + t * [exp(x)  x  1]. Special case t = 1 gives e.g.f. for A000311. These results are a special case of A134685 with u(x) = B(x).
From Tom Copeland, Oct 26 2008: (Start)
UmbralSheffer formalism gives, for m a positive integer and u = t/(t+1),
[P(.,t)+Q(.,x)]^m = [m Q(m1,x)  t Q(m,x)]/(t+1) + sum(n>=1) { n^(n1)[u exp(u)]^n/n! [n/(t+1)+Q(.,x)]^m }, when the series is convergent for a sequence of functions Q(n,x).
Check: With t=1; Q(n,x)=0^n, for n>=0; and Q(1,x)=0, then [P(.,1)+Q(.,x)]^m = P(m,1) = A000311(m).
(End)
Let h(x,t) = 1/(dB(x)/dx) = 1/(1t*(exp(x)1)), an e.g.f. in x for row polynomials in t of A019538, then the nth row polynomial in t of the table A134991, P(n,t), is given by ((h(x,t)*d/dx)^n)x evaluated at x=0, i.e., A(x,t) = exp(x*P(.,t)) = exp(x*h(u,t)*d/du) u evaluated at u=0. Also, dA(x,t)/dx = h(A(x,t),t).  Tom Copeland, Sep 05 2011
The polynomials (1+t)/t*P(n,t) are the row polynomials of A112493. Let f(x) = (1+x)/(1x*t). Then for n >= 0, P(n+1,t) is given by t/(1+t)*(f(x)*d/dx)^n(f(x)) evaluated at x = 0.  Peter Bala, Sep 30 2011
From Tom Copeland, Oct 04 2011: (Start)
a(n,k)=(k+1)a(n1,k)+(n+k+1)a(n1,k1) with starting indices n=0 and k=0 beginning with P(2,t) (as suggested by a formula of David Speyer on MathOverflow). a(n,k)= k a(n1,k)+(n+k1)a(n1,k1) with starting indices n=1 and k=1 of table (cf. Smiley above and Riordin ref.[10] therein).
P(n,t) = (1/(1+t))^n sum(k=1 to infin) k^(n+k1) [(u*exp(u)]^k / k! with u=(t/(t+1)) for n>1; therefore, sum(k=1 to infin) (1)^k k^(n+k1) x^k/k!
= [1+LW(x)]^(n) P{n,LW(x)/[1+LW(x)]}, with LW(x) the Lambert WFct.
a(n,k)= sum(i=0 to k) {(1)^i binom(n+k,i) sum(j=0 to ki) (1)^j (kij)^(n+ki)/[j!(kij)!]} from relation to A008299. (End)
The e.g.f. A(x,t) = v * { sum(j=1 to infin) D(j1,u) (z)^j / j! } where u=(xt)/(1+t) , v=1+u, z= x/[(1+t) v^2] and D(j1,u) are the polynomials of A042977. dA/dx= 1/[(1+t)(vA)]= 1/{1t*[exp(A)1]}.  Tom Copeland, Oct 06 2011


MATHEMATICA

t[n_, k_] := Sum[(1)^i*Binomial[n, i]*Sum[(1)^j*(kij)^(ni)/(j!*(kij)!), {j, 0, ki}], {i, 0, k}]; row[n_] := Table[t[k, kn], {k, n+1, 2*n}]; Table[row[n], {n, 1, 9}] // Flatten (* JeanFrançois Alcover, Apr 23 2014, after A008299 *)


CROSSREFS

Cf. A112493. A181996 is the mirror image.
Sequence in context: A068438 A064060 A176740 * A212930 A225725 A095327
Adjacent sequences: A134988 A134989 A134990 * A134992 A134993 A134994


KEYWORD

nonn,tabl


AUTHOR

Tom Copeland, Feb 05 2008


EXTENSIONS

Edited by N. J. A. Sloane, Apr 05 2012


STATUS

approved



