Actually, the base library does this in two steps: generate a random integer i in 1:length(231:33:423), and then indexing this StepRange at i, i.e. (231:33:423)[i]. So your approach generalizes very easily too. But as @bkamins nicely explained, this is not as perfectly distributed as the base method.