login
A365985
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
1, 0, 2, 0, 3, 10, 0, 85, 114, 134, 0, 13317, 10029, 6972, 4606, 0, 8300125, 4026580, 1756610, 866300, 389882, 0, 19743155103, 6020248905, 1736497215, 589363590, 231745290, 78631330
OFFSET
0,3
EXAMPLE
Triangle begins ...
1;
0, 2;
0, 3, 10;
0, 85, 114, 134;
0, 13317, 10029, 6972, 4606;
...
CROSSREFS
Cf. A355730 (row sums).
Sequence in context: A255384 A236396 A251592 * A327244 A325816 A121065
KEYWORD
nonn,tabl,more
AUTHOR
Geoffrey Critzer, Sep 24 2023
EXTENSIONS
Row n = 5 from Pontus von Brömssen, Sep 24 2023
Row n = 6 from Pontus von Brömssen, Sep 25 2023
STATUS
approved