==> combinatorics/transitions.p <== How many n-bit binary strings (0/1) have exactly k transitions (an adjacent pair of dissimilar bits, i.e., a 01 or a 10)?