A139624
Table read by rows: T(n,k) is the number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).
Original entry on oeis.org
1, 1, 1, 3, 2, 1, 6, 7, 3, 1, 11
Offset: 1
Triangle begins
1;
1, 1;
3, 2, 1;
6, 7, 3, 1;
A139628
Row sums of A139623, number of directed multigraphs with loops and no vertex of degree 0, with n arcs, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).
Original entry on oeis.org
A139630
Row sums of A139625, number of strongly connected directed multigraphs with loops and no vertex of degree 0, with n arcs, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).
Original entry on oeis.org
1, 1, 1, 1, 2, 3, 7, 11, 20, 30, 47, 71, 117, 201, 369, 703, 1323, 2463, 4446
Offset: 0
A136868
Table read by antidiagonals: T(n,k) is the number of connected directed multigraphs with loops with n arcs and k vertices, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).
Original entry on oeis.org
1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 4, 1, 0, 1, 2, 6, 7, 1, 0, 1, 2, 6, 14, 12, 1, 0, 1, 2, 6, 17
Offset: 0
Triangle begins:
1,
1, 0,
1, 1, 0,
1, 2, 1, 0,
1, 2, 4, 1, 0,
1, 2, 6, 7, 1, 0,
1, 2, 6,14,12, 1, 0,
Showing 1-4 of 4 results.
Comments