3,1

Row n contains 1 + floor(n/2) entries.

Sum of entries in row n = n(2n-1) = A000384(n).

T(n,1) = 3n = number of edges in the corresponding graph.

Sum_{k>=1} k*T(n,k) = A138179(n).

The generating polynomial of row n (i.e., the Wiener polynomial of the circular ladder of order n) has been obtained from the Wiener polynomial of the cycle C_n (see the Sagan et al. paper) and by determining the distribution of the distances from the nodes of one cycle to the nodes of the other cycle. They can also be derived from the Doslic paper (Corollary 11 and Lemma 1).

J. Gross and J. Yellen, Graph Theory and its Applications, CRC, Boca Raton, 1999 (p. 14).

T. Doslic, Vertex-weighted Wiener polynomials for composite graphs, Ars Mathematica Contemporanea, 1, 2008, 66-80.

B. E. Sagan, Y-N. Yeh and P. Zhang, The Wiener Polynomial of a Graph, Internat. J. of Quantum Chem., 60, 1996, 959-969.

The generating polynomial for row 2n+1 is (2n+1)(3t+t^2-2t^{n+1}-2t^{n+2})/(1-t) and for row 2n it is 2n(3t+t^2-t^n-2t^{n+1}-t^{n+2})/(1-t) (these are also the Wiener polynomials of the corresponding circular ladders).

The bivariate g.f. G=G(t,z) appears in the Maple program.

T(3,2)=6 because in P_2 X C_3 there are six unordered pairs of nodes at distance 2 (from the vertices of the outer triangle to the "opposite" vertices of the inner triangle).

Triangle starts:

9, 6;

12, 12, 4;

15, 20, 10;

18, 24, 18, 6;

21, 28, 28, 14;

G := t*z^3*(9+6*t-6*z+4*t^2*z-16*t*z^2-10*t^2*z^2+8*t*z^3 +2*t^2*z^3 -2*t^3*z^3 +7*t^2*z^4+4*t^3*z^4-4*t^2*z^5-2*t^3*z^5) / ((1-z)^2*(1-t*z^2)^2): Gser := simplify(series(G, z = 0, 19)): for n from 3 to 16 do P[n] := sort(expand(coeff(Gser, z, n))) end do: for n from 3 to 16 do seq(coeff(P[n], t, j), j = 1 .. 1+floor((1/2)*n)) end do; # yields sequence in triangular form

Cf. A000384, A138179.

Sequence in context: A137907 A070164 A063602 * A182873 A180856 A166520

Adjacent sequences: A180569 A180570 A180571 * A180573 A180574 A180575

nonn,tabf

Emeric Deutsch, Sep 16 2010

approved