Number of set partitions B'_t(n) of {1,2,...,t} into at most n parts, so that no part contains both 1 and t, or both i and i+1 with 1 <= i < t; triangle B'_t(n), t>=0, 0<=n<=t, read by rows.
A261137
Number of set partitions B'_t(n) of {1,2,...,t} into at most n parts, so that no part contains both 1 and t, or both i and i+1 with 1 <= i < t; triangle B'_t(n), t>=0, 0<=n<=t, read by rows.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =0a(9) =1a(10) =0a(11) =0a(12) =1a(13) =3a(14) =4a(15) =0a(16) =0a(17) =0a(18) =5a(19) =10a(20) =11a(21) =0a(22) =0a(23) =1a(24) =11a(25) =31a(26) =40a(27) =41a(28) =0a(29) =0
External references
- oeis: A261137