  We describe efficient algorithms to search for cases in which binomial
coefficients are equal or almost equal, give a conjecturally complete list of
all cases where two binomial coefficients differ by 1, and give some identities
for binomial coefficients that seem to be new.
