Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= 2n-3) is the number of non-crossing connected graphs on n nodes on a circle, having k edges. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
A127537
Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= 2n-3) is the number of non-crossing connected graphs on n nodes on a circle, having k edges. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
Terms
- a(0) =1a(1) =0a(2) =3a(3) =1a(4) =0a(5) =0a(6) =12a(7) =9a(8) =2a(9) =0a(10) =0a(11) =0a(12) =55a(13) =66a(14) =30a(15) =5a(16) =0a(17) =0a(18) =0a(19) =0a(20) =273a(21) =455a(22) =315a(23) =105a(24) =14a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0
External references
- oeis: A127537