|
%I #15 Jan 28 2024 04:52:45
%S 1,0,5,3,0,5,31,35,12,0,0,54,231,346,225,55,0,1,51,532,1942,3366,3062,
%T 1430,273,0,0,39,784,5253,17631,33300,37312,24804,9100,1428
%N Irregular triangle read by rows: T(n,k) = number of crossing connected diagrams in a disk having n crossings and k vertices.
%H V. Pilaud and J. Rué, <a href="https://arxiv.org/abs/1307.6440">Analytic combinatorics of chord and hyperchord diagrams with k crossings</a>, arXiv preprint arXiv:1307.6440 [math.CO], 2013.
%e Triangle begins:
%e 1;
%e 0, 5, 3;
%e 0, 5, 31, 35, 12;
%e 0, 0, 54, 231, 346, 225, 55;
%e 0, 1, 51, 532, 1942, 3366, 3062, 1430, 273;
%e 0, 0, 39, 784, 5253, 17631, 33300, 37312, 24804, 9100, 1428;
%e ...
%Y Cf. A232226 (row sums), A232227.
%K nonn,tabf,more
%O 1,3
%A _N. J. A. Sloane_, Nov 22 2013
|
