A139625 - cp's OEIS frontend

A139625 Table read by rows: T(n,k) is the number of strongly 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).

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	2
8	1
9	6
10	1
11	10
12	1
13	19
14	1
15	28
16	1
17	1
18	44
19	2
20	1
21	60
22	10
23	1
24	85
25	31
26	1
27	110
28	90
29	1
30	146
31	222
32	1
33	182
34	520
35	1
36	231
37	1090
38	1
39	1
40	280
41	2180
42	2
43	1
44	344
45	4090
46	11
47	1

[1, 1, 1, 1, 1, 1, 2, 1, 6, 1, 10, 1, 19, 1, 28, 1, 1, 44, 2, 1, 60, 10, 1, 85, 31, 1, 110, 90, 1, 146, 222, 1, 182, 520, 1, 231, 1090, 1, 1, 280, 2180, 2, 1, 344, 4090, 11, 1]

cp's OEIS Frontend

A139625 Table read by rows: T(n,k) is the number of strongly 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).

Table of values

List of values