No... it's pretty clear that there are exactly n ways to get each particular single-cycle permutation, given by the n rotations of the fisher-yates shuffle. For example, if you rotate the parent's shuffle by one:

2, 4, 3, 0, 5, 1

you get the same single-cycle permutation.

I think this might actually lead to a easier proof than in the article.