T(n,k), for n,k >= 1, is the number of partitions of the set [n] into k blocks, where, if the blocks are arranged in order of their minimal element, the odd-indexed blocks are all singletons.
A246118
T(n,k), for n,k >= 1, is the number of partitions of the set [n] into k blocks, where, if the blocks are arranged in order of their minimal element, the odd-indexed blocks are all singletons.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =1a(8) =2a(9) =1a(10) =0a(11) =1a(12) =3a(13) =4a(14) =1a(15) =0a(16) =1a(17) =4a(18) =11a(19) =6a(20) =1a(21) =0a(22) =1a(23) =5a(24) =26a(25) =23a(26) =9a(27) =1a(28) =0a(29) =1
External references
- oeis: A246118