Number of partitions of set [n] in a set of <= k noncrossing subsets. Number of Dyck n-paths with at most k peaks. Both with 0 <= k <= n, read by rows.
A349740
Number of partitions of set [n] in a set of <= k noncrossing subsets. Number of Dyck n-paths with at most k peaks. Both with 0 <= k <= n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =1a(8) =4a(9) =5a(10) =0a(11) =1a(12) =7a(13) =13a(14) =14a(15) =0a(16) =1a(17) =11a(18) =31a(19) =41a(20) =42a(21) =0a(22) =1a(23) =16a(24) =66a(25) =116a(26) =131a(27) =132a(28) =0a(29) =1
External references
- oeis: A349740