Let's say I have a list of 4 elements : [a,b,c,d]. There are 5 ways to split this list, with no rearranging such that no sublist has more than two elements:
[a,b,c,d],[ab,c,d],[ab,cd],[a,bc,d] and [a,b,cd].
In general, with n elements, how can one count the number of ways to split a list? This is quite similar to the stars and bars problem; however, we have distinguishable stars, but indistinguishable bins.