Ways to arrange N nesting dolls when each doll comes apart into a top and a bottom half. Every configuration for N = 1 to 4 is drawn below.
Further terms, N = 1…16:
This is A124426, the product of two consecutive Bell numbers: a(N) = B(N)·B(N+1). The bottoms and closed dolls form stacks, and any grouping of the N dolls into stacks works. That gives B(N) ways. Each stack's order is forced by size. The loose tops then stack among themselves. Choosing which dolls are open and how their tops stack gives B(N+1) ways in total. A brute-force enumeration agrees for N ≤ 6.