Nice stuff chaps.
Claudes patch in words:
Generate a random number R in range 0 to n, output it, and store it
Generate a new random number R in range 0 to n, and compare it to the stored number
If they are non-equal output R, and store it
else generate a new random number S = R+(1+(n-1)) mod n, output S and store it
Did I see that right Claude?
These are musically useful. Another good one is [urn]. That gives unique random numbers from 0 to n, so each of 0, 1, 2 ... n appears only once during any sequence of n bangs. In other words a permutation (reordering) of 0 through n