Bell numbers and k-trees

We show that the number of partitions of {1, … , n} with the restriction that each integer i is not in the same part as i − 1 is the Bell number Bn − 1. We generalize this result to partitions of the vertices of k-trees.