|
%I #8 Dec 09 2018 09:43:53
%S 1,0,3,0,1,12,0,0,10,55,0,0,4,77,273,0,0,1,60,546,1428,0,0,0,35,624,
%T 3740,7752,0,0,0,15,546,5600,25194,43263,0,0,0,5,391,6405,46512,
%U 168245,246675,0,0,0,1,240,6125,65076,368676,1118260,1430715,0,0,0,0,126,5138,76296,606879,2833600,7413705,8414640,0,0,0,0,56,3857,78880,834195,5348420,21312720,49085400,50067108
%N Triangle read by rows: T(n,k) = number of connected matchings with n crossings and k chords, in a disk.
%H V. Pilaud, J. Rué, <a href="http://arxiv.org/abs/1307.6440">Analytic combinatorics of chord and hyperchord diagrams with k crossings</a>, arXiv preprint arXiv:1307.6440, 2013
%e Triangle begins:
%e 1,
%e 0,3,
%e 0,1,12,
%e 0,0,10,55,
%e 0,0,4,77,273,
%e 0,0,1,60,546,1428,
%e 0,0,0,35,624,3740,7752,
%e 0,0,0,15,546,5600,25194,43263,
%e 0,0,0,5,391,6405,46512,168245,246675,
%e ...
%Y Cf. A232222 (row sums), A000699 (column sums), A322456 (transpose).
%K nonn,tabl
%O 1,3
%A _N. J. A. Sloane_, Nov 22 2013
%E 3 more rows. - _R. J. Mathar_, Dec 09 2018
|
