|
%I #19 Jan 01 2021 15:44:33
%S 1,2,1,8,11,5,1,64,161,167,102,39,9,1,1024,3927,6698,7185,5477,3107,
%T 1329,423,96,14,1,32768,172665,419364,656733,757939,686425,504084,
%U 305207,153333,63789,21752,5959,1267,197,20,1,2097152,14208231,45263175,94040848,145990526,181444276,187742937,165596535
%N Irregular table read by rows: The number of acyclic digraphs on n labeled nodes with k descents.
%D Archer, K., Gessel, I. M., Graves, C., & Liang, X. (2020). Counting acyclic and strong digraphs by descents. Discrete Mathematics, 343(11), 112041. See Table 3
%H Kassie Archer, Ira M. Gessel, Christina Graves, and Xuming Liang, <a href="https://arxiv.org/abs/1909.01550">Counting acyclic and strong digraphs by descents</a>, arXiv:1909.01550 [math.CO], 20 Mar 2020. See Table 3.
%H K. Archer, C. Graves, <a href="https://arxiv.org/abs/1709.00601">Enumerating acyclic digraphs by descents</a>, arXiv:1709.00601 [math.CO], 2017.
%e 1;
%e 2 1;
%e 8 11 5 1;
%e 64 161 167 102 39 9 1;
%e 1024 3927 6698 7185 5477 3107 1329 423 96 14 1;
%e ...
%Y Cf. A003024 (row sums), A006125, A057273, A339590, A339807.
%K nonn,tabf
%O 1,2
%A _R. J. Mathar_, Mar 21 2019
|
