login
Triangular array read by rows: T(n,k) is the number of binary relations on [n] that are dense (A355730) and have exactly k strongly connected components, n>=0, 0<=k<=n.
0

%I #15 Sep 27 2023 13:46:25

%S 1,0,2,0,3,10,0,85,114,134,0,13317,10029,6972,4606,0,8300125,4026580,

%T 1756610,866300,389882,0,19743155103,6020248905,1736497215,589363590,

%U 231745290,78631330

%N Triangular array read by rows: T(n,k) is the number of binary relations on [n] that are dense (A355730) and have exactly k strongly connected components, n>=0, 0<=k<=n.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Dense_order">Dense order</a>.

%e Triangle begins ...

%e 1;

%e 0, 2;

%e 0, 3, 10;

%e 0, 85, 114, 134;

%e 0, 13317, 10029, 6972, 4606;

%e ...

%Y Cf. A355730 (row sums).

%K nonn,tabl,more

%O 0,3

%A _Geoffrey Critzer_, Sep 24 2023

%E Row n = 5 from _Pontus von Brömssen_, Sep 24 2023

%E Row n = 6 from _Pontus von Brömssen_, Sep 25 2023