Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.
A100862
Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =1a(7) =6a(8) =6a(9) =1a(10) =1a(11) =10a(12) =21a(13) =10a(14) =1a(15) =1a(16) =15a(17) =55a(18) =55a(19) =15a(20) =1a(21) =1a(22) =21a(23) =120a(24) =215a(25) =120a(26) =21a(27) =1a(28) =1a(29) =28
External references
- oeis: A100862