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 allowed, 0 <= k <= n.
A390897
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 allowed, 0 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =1a(7) =9a(8) =6a(9) =1a(10) =1a(11) =30a(12) =33a(13) =10a(14) =1a(15) =1a(16) =105a(17) =185a(18) =85a(19) =15a(20) =1a(21) =1a(22) =369a(23) =1050a(24) =695a(25) =180a(26) =21a(27) =1a(28) =1a(29) =1281
External references
- oeis: A390897