Recursion challenge

[Moneo]

The algorithms work differently, the ones I posted generate strings of zeros and ones representing the values in Gray code for any arbitary byte length. Your algorithm only works for powers of two and generates the corresponding integer values instead.

If I wanted to generate strings of zeros and ones, I could add 3 or 4 lines of code to do this (I think I posted this somewhere before). But the point is that I don´t want to generate strings of 0 and 1, I want to generate bytes or words. The application that receives these bytes or words wants the binary representation of these bytes or words to conform to Gray Code, that is, that each one differs from the preceding by only one bit.

POWERS OF 2: My algorithm has an upper boundary of a power of 2 (minus 1) intentionally, so that the highest value generated wraps back (with only 1 bit change) to zero which is the first pattern of the next series (if you want to generate multiple series).

Also at issue here is the fact that I have used this algorithm twice in business for practical applications, not just for academic purposes.

Sorry, but I don't quite understand the rest of your argument.
What does AFIAK mean?
*****