Let 𝝫𝑛 be the set of the binary strategy-proof social choice functions referred to a group of n voters who are allowed to declare indifference between the alternatives. We provide a recursive way to obtain the set 𝝫𝑛+1 from the set 𝝫𝑛. Computing the cardinalities |𝝫𝑛|...