In a generalized arithmetic progression there is a set of constant differences you can choose from at each step. So a generalized arithmetic progression starting at 0 with possible constant differences 2, 3, and 5 would contain at least every multiple of 2, every multiple of 3, and every multiple of 5. I'm interested in a more limited case, where the constant differences have a fixed order (not necessarily sorted), and each step we round robin the differences -- we can no longer make an arbitrary choice of constant difference at each step. Is there a name for that I can Google for to learn about?
For example, for such a 'circular arithmetic progression' (what I'm calling it for lack of name) if the constant differences were (2, 3, 5), the progression would be:
0 2 5 10 12 15 20 22 ...
Which would be distinct from if the constant differences were (3, 5, 2):
0 3 8 10 13 18 20 23 ...