Triangle read by rows: T(n,k) is the number of sets of noncrossing paths of size k whose nodes are a subset of n nodes arranged in a circle with one node paths disallowed, 0 <= k <= floor(n/2).
A390896
Triangle read by rows: T(n,k) is the number of sets of noncrossing paths of size k whose nodes are a subset of n nodes arranged in a circle with one node paths disallowed, 0 <= k <= floor(n/2).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =6a(6) =1a(7) =26a(8) =3a(9) =1a(10) =100a(11) =45a(12) =1a(13) =363a(14) =435a(15) =15a(16) =1a(17) =1274a(18) =3465a(19) =420a(20) =1a(21) =4372a(22) =24794a(23) =7140a(24) =105a(25) =1a(26) =14760a(27) =165942a(28) =95760a(29) =4725
External references
- oeis: A390896