Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows.

A287640

Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =4a(6) =1a(7) =13a(8) =1a(9) =1a(10) =41a(11) =9a(12) =1a(13) =1a(14) =131a(15) =59a(16) =11a(17) =1a(18) =1a(19) =428a(20) =344a(21) =88a(22) =15a(23) =1a(24) =1a(25) =1429a(26) =1906a(27) =634a(28) =146a(29) =23

External references