A185289 - cp's OEIS frontend

A185289 In a bipartite graph with 2n vertices (|V_1|=|V_2|=n), this sequence gives the number of ways to create n edges, one for each vertex of V_1, and to rank the vertices of V_2 which have incident edges.

n	a(n)
0	1
1	1
2	6
3	75
4	1612
5	52805
6	2442666
7	151382959
8	12093970008
9	1209295535049
10	147859385866390
11	21692929137930611
12	3759744512444581860
13	759740612270504941453
14	177000400360669503651138
15	47085371754008630756331255
16	14182051733113750632290151856

[1, 1, 6, 75, 1612, 52805, 2442666, 151382959, 12093970008, 1209295535049, 147859385866390, 21692929137930611, 3759744512444581860, 759740612270504941453, 177000400360669503651138, 47085371754008630756331255, 14182051733113750632290151856]

cp's OEIS Frontend

A185289 In a bipartite graph with 2n vertices (|V_1|=|V_2|=n), this sequence gives the number of ways to create n edges, one for each vertex of V_1, and to rank the vertices of V_2 which have incident edges.

Table of values

List of values