BndB_n^d Bnd
is the number of ways of partitioning the set {1,2,...,n}\{1, 2, ..., n\}{1,2,...,n} such that in each subset, elements have pairwise distance at least ddd.
I couldn't find any scientific articles on these numbers. Consider summing up reduced Stirling numbers of the second kind