Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
A089434
Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
Terms
- a(0) =1a(1) =3a(2) =1a(3) =12a(4) =9a(5) =2a(6) =55a(7) =66a(8) =30a(9) =5a(10) =273a(11) =455a(12) =315a(13) =105a(14) =14a(15) =1428a(16) =3060a(17) =2856a(18) =1428a(19) =378a(20) =42a(21) =7752a(22) =20349a(23) =23940a(24) =15960a(25) =6300a(26) =1386a(27) =132a(28) =43263a(29) =134596
External references
- oeis: A089434