Triangle read by rows: T(n,k) is the number of noncrossing path sets on n nodes with k paths and isolated vertices allowed, 0 <= k <= n.

A390909

Triangle read by rows: T(n,k) is the number of noncrossing path sets on n nodes with k paths and isolated vertices allowed, 0 <= k <= n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =3a(8) =3a(9) =1a(10) =0a(11) =8a(12) =14a(13) =6a(14) =1a(15) =0a(16) =20a(17) =55a(18) =40a(19) =10a(20) =1a(21) =0a(22) =48a(23) =195a(24) =215a(25) =90a(26) =15a(27) =1a(28) =0a(29) =112

External references