Problem 1272. The almost-birthday problem.

This is a harder version of the birthday problem. Now, you will have to determine the probability that two or more people in a randomly assembled group of n people are having their birthdays within d days of each other. As usual, ignore the leap year and assume that every day is equally probable.