Triangle read by rows: T(n,k) is the number of sets of noncrossing paths of size k that cover n nodes arranged in a circle with one node paths disallowed, 0 <= k <= floor(n/2).
A390893
Triangle read by rows: T(n,k) is the number of sets of noncrossing paths of size k that cover n nodes arranged in a circle with one node paths disallowed, 0 <= k <= floor(n/2).
Terms
- a(0) =1a(1) =0a(2) =0a(3) =1a(4) =0a(5) =3a(6) =0a(7) =8a(8) =3a(9) =0a(10) =20a(11) =30a(12) =0a(13) =48a(14) =210a(15) =15a(16) =0a(17) =112a(18) =1260a(19) =315a(20) =0a(21) =256a(22) =6944a(23) =4200a(24) =105a(25) =0a(26) =576a(27) =36288a(28) =45360a(29) =3780
External references
- oeis: A390893