In computing, an integer version of this sequence is often used to generate a discrete uniform distribution rather than a continuous one.
Instead of using an irrational number, which cannot be calculated on a digital computer, the ratio of two integers is used in its place.
An integer k is chosen, relatively prime to an integer modulus m. In the common case that m is a power of 2, this amounts to requiring that k is odd.
The term appears to originate with George Marsaglia’s paper "Xorshift RNGs".
[3] The following C code generates what Marsaglia calls a "Weyl sequence": In this case, the odd integer is 362437, and the results are computed modulo m = 232 because d is a 32-bit quantity.