|
%I #12 Mar 30 2021 01:26:25
%S 1,2,1,6,6,1,24,26,12,1,110,120,75,20,1,546,594,416,174,30,1,2856,
%T 3094,2289,1176,350,42,1,15504,16728,12768,7322,2880,636,56,1,86526,
%U 93024,72420,44388,20475,6324,1071,72,1,493350,528770,417240,267240,136252,51495,12740,1700,90,1
%N Triangle read by rows: T(n,k) is the number of nonseparable planar maps with r*n edges and a fixed outer face of r*k edges which are invariant under a rotation of 1/r for any r >= 2 (independent of actual value of r).
%C Table I in the Brown reference.
%H Andrew Howroyd, <a href="/A091599/b091599.txt">Table of n, a(n) for n = 1..1275</a> (rows 1..50)
%H W. G. Brown, <a href="http://dx.doi.org/10.4153/CJM-1963-056-7">Enumeration of non-separable planar maps</a>, Canad. J. Math., 15 (1963), 526-545.
%F T(n, k) = k*(Sum_{j=k..min(n, 2*k)} (2*j-k)*(j-1)!*(3*n-j-k-1)!/(((j-k)!)^2*(2*k-j)!*(n-j)!))/(2*n-k)!
%e Triangle starts:
%e 1;
%e 2, 1;
%e 6, 6, 1;
%e 24, 26, 12, 1;
%e 110, 120, 75, 20, 1;
%e ...
%p T := proc(n,k) if k<=n then k*sum((2*j-k)*(j-1)!*(3*n-j-k-1)!/(j-k)!/(j-k)!/(2*k-j)!/(n-j)!,j=k..min(n,2*k))/(2*n-k)! else 0 fi end: seq(seq(T(n,k), k=1..n),n=1..11);
%o (PARI) T(n, k) = k*sum(j=k, min(n, 2*k), (2*j-k)*(j-1)!*(3*n-j-k-1)!/(((j-k)!)^2*(2*k-j)!*(n-j)!))/(2*n-k)!
%o for(n=1, 10, for(k=1, n, print1(T(n,k), ", ")); print) \\ _Andrew Howroyd_, Mar 29 2021
%Y Column 1 gives A046646, column 2 gives A046647, row sums give A000259.
%Y Same as A046651 but with rows reversed.
%Y Cf. A046653, A091665.
%K nonn,tabl
%O 1,2
%A _Emeric Deutsch_, Mar 03 2004
%E Name clarified by _Andrew Howroyd_, Mar 29 2021
|
