Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1).
A143022
Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle in which the root (a distinguished node) has degree k (n >= 2, 1 <= k <= n-1).
Terms
- a(0) =1a(1) =2a(2) =2a(3) =9a(4) =10a(5) =4a(6) =54a(7) =62a(8) =32a(9) =8a(10) =374a(11) =436a(12) =248a(13) =88a(14) =16a(15) =2820a(16) =3316a(17) =1984a(18) =816a(19) =224a(20) =32a(21) =22485a(22) =26586a(23) =16404a(24) =7320a(25) =2416a(26) =544a(27) =64a(28) =186494a(29) =221350
External references
- oeis: A143022