Partitions and Clifford algebras

Given the set [n]={1,…,n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and non-overlapping partitions of [n]. The result is recovery of Stirling numbers of the second kind, Bell numbers, and Bessel numbers.