Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge.
A368924
Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =1a(6) =1a(7) =9a(8) =6a(9) =1a(10) =15a(11) =68a(12) =48a(13) =12a(14) =1a(15) =222a(16) =720a(17) =510a(18) =150a(19) =20a(20) =1a(21) =3670a(22) =9738a(23) =6825a(24) =2180a(25) =360a(26) =30a(27) =1a(28) =68820a(29) =159628
External references
- oeis: A368924