Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle having root (a distinguished node) of degree 1 and having k edges (n >= 2, 1 <= k <= 2n-4).
A143024
Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle having root (a distinguished node) of degree 1 and having k edges (n >= 2, 1 <= k <= 2n-4).
Terms
- a(0) =1a(1) =0a(2) =2a(3) =0a(4) =0a(5) =7a(6) =2a(7) =0a(8) =0a(9) =0a(10) =30a(11) =20a(12) =4a(13) =0a(14) =0a(15) =0a(16) =0a(17) =143a(18) =156a(19) =65a(20) =10a(21) =0a(22) =0a(23) =0a(24) =0a(25) =0a(26) =728a(27) =1120a(28) =720a(29) =224
External references
- oeis: A143024