|
%I #10 Sep 06 2017 04:07:41
%S 3,5,7,9,11,14,16,18,21,23,25,27,30,32,34,37,39,41,43,46,48,50,52,55,
%T 57,59,61,64,66,68,71,73,75,77,80,82,84,86,89,91,93,95,98,100,102,104,
%U 107,109,111,114,116,118,120,123,125,127,129,132
%N a(n) is the minimal position at which the maximal value of row n appears in row n of triangle A100960.
%H Gheorghe Coserea, <a href="/A291839/b291839.txt">Table of n, a(n) for n = 3..126</a>
%H E. A. Bender, Z. Gao and N. C. Wormald, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v9i1r43">The number of labeled 2-connected planar graphs</a>, Electron. J. Combin., 9 (2002), #R43.
%F a(n) ~ c*n + o(sqrt(n)), where c=2.26287583256262... (A291840).
%F T(n, a(n)) = max {T(n,k), n <= k <= 3*(n-2) }, where T(n,k) is defined by A100960.
%o (PARI)
%o Q(n,k) = { \\ c-nets with n-edges, k-vertices
%o if (k < 2+(n+2)\3 || k > 2*n\3, return(0));
%o sum(i=2, k, sum(j=k, n, (-1)^((i+j+1-k)%2)*binomial(i+j-k,i)*i*(i-1)/2*
%o (binomial(2*n-2*k+2,k-i)*binomial(2*k-2, n-j) -
%o 4*binomial(2*n-2*k+1, k-i-1)*binomial(2*k-3, n-j-1))));
%o };
%o A100960_ser(N) = {
%o my(x='x+O('x^(3*N+1)), t='t+O('t^(N+4)),
%o q=t*x*Ser(vector(3*N+1, n, Polrev(vector(min(N+3, 2*n\3), k, Q(n,k)),'t))),
%o d=serreverse((1+x)/exp(q/(2*t^2*x) + t*x^2/(1+t*x))-1),
%o g2=intformal(t^2/2*((1+d)/(1+x)-1)));
%o serlaplace(Ser(vector(N, n, subst(polcoeff(g2, n,'t),'x,'t)))*'x);
%o };
%o A291839_seq(N) = {
%o my(g2=apply(Vecrev, Vec(A100960_ser(N+2))), m=apply(vecmax, g2));
%o apply(v->vecmin(v)-1, vector(#g2, k, select(v->v==m[k], g2[k], 1)));
%o };
%o A291839_seq(22)
%Y Cf. A100960, A291837.
%K nonn
%O 3,1
%A _Gheorghe Coserea_, Sep 05 2017
|
