|
%I #19 Mar 08 2023 23:17:30
%S 1,1,1,1,6,1,1,25,25,1,1,90,290,90,1,1,301,2450,2450,301,1,1,966,
%T 17451,41580,17451,966,1,1,3025,112035,544971,544971,112035,3025,1,1,
%U 9330,671980,6076350,12122502,6076350,671980,9330,1,1,28501,3846700,60738700,217523922,217523922,60738700,3846700,28501,1
%N Triangle read by rows: counts series-parallel networks by the number of series connections.
%C T(n,k) is the number of series-parallel matroids on [n+1] of rank k. - _Andrew Howroyd_, Mar 08 2023
%H Andrew Howroyd, <a href="/A140945/b140945.txt">Table of n, a(n) for n = 1..1275</a> (rows 1..50; first 17 rows from Brian Drake, Jul 24 2008)
%H B. Drake, <a href="http://people.brandeis.edu/~gessel/homepage/students/drakethesis.pdf">An inversion theorem for labeled trees and some limits of areas under lattice paths (Example 1.5.1)</a>, A dissertation presented to the Faculty of the Graduate School of Arts and Sciences of Brandeis University.
%H Luis Ferroni and Matt Larson, <a href="https://arxiv.org/abs/2303.02253">Kazhdan-Lusztig polynomials of braid matroids</a>, arXiv:2303.02253 [math.CO], 2023.
%F E.g.f. is reversion of log(1+ax)/a+log(1+bx)/b-x.
%F Let f(x,t) = (1+x)*(1+x*t)/(1-x^2*t) and let D be the operator f(x,t)*d/dx. Then the n-th row polynomial equals (D^n)(f(x,t)) evaluated at x = 0. - Peter Bala, Sep 29 2011
%e Triangle begins:
%e 1;
%e 1, 1;
%e 1, 6, 1;
%e 1, 25, 25, 1;
%e 1, 90, 290, 90, 1;
%e 1, 301, 2450, 2450, 301, 1;
%e 1, 966, 17451, 41580, 17451, 966, 1;
%e ...
%p N:=6: 1/a*log(1+a*y)+1*log(1+b*y)/b-y=x: solve(%, y):series(%, x, N): simplify(%, symbolic): convert(%, polynom): subs(b=1, %): R:= [seq(i!*coeff(%, x, i), i=1..N-1)]: seq( seq(coeff(R[i], a, j), j=0..i-1), i=1..N-1);
%o (PARI) T(n) = {[Vecrev(p) | p<-Vec(serlaplace(intformal(serreverse(log(1 + x*y + O(x*x^n))/y + log(1 + x + O(x*x^n)) - x))))]}
%o { my(A=T(10)); for(i=1, #A, print(A[i])) } \\ _Andrew Howroyd_, Mar 08 2023
%Y Row sums are A006351.
%Y Second column is A000392.
%Y Cf. A359985.
%K easy,nonn,tabl
%O 1,5
%A _Brian Drake_, Jul 24 2008
|
