Fortunately, if you want that sort of thing in Lisp there's always the iterate library: https://common-lisp.net/project/iterate/
It looks pretty good to me, and I hear good things about it, although frankly I've always just used LOOP.
Still very much a language on its own. Rackets loops look very much like a regular lisp construct.
It sounds like you're the kind of person who'd prefer DOTIMES[0], DOLIST[1], and so on. Lisp has a lot of different ways to handle iteration, it's the curse of flexibility when people have such varying tastes. Another great option that often gets overlooked is the Series package[2], which lets you write in a functional style and then mostly optimises that away.
0: http://www.lispworks.com/documentation/HyperSpec/Body/m_doti...
1: http://www.lispworks.com/documentation/HyperSpec/Body/m_doli...
2: http://www.cs.cmu.edu/Groups/AI/html/cltl/clm/node348.html#S...
DOTIMES is not my cup of tea. I don't like to have to use mutation to get things done. I prefer to have an explicit but more verbose style (named let) or to use a for loop.
A matter of preference of course. The benefits of for loops or named lets is that they are functional and thus continuation safe. I did a bunch of continuation-based nondeterminism things last year, and knowing things weren't mutating was nice.
If you need it, there is also an implementation of CL:LOOP for Racket.
Which is rather slow and doesn't add much. Other than awe that someone actually managed to do it :)
Maybe it's not so slow with a better compiler, like the one from Chez Scheme - or is the implementation the problem?
Most scheme implementations are better at optimizing non-mutating code since it can draw conclusions about types and such easier. Chez probably does a better job than racket because Chez is pretty spectacular :)
I still haven't actually had an occurrence when for/fold hasn't been enough for my special case needs.