https://www.lodev.org/jstumble/?board=rrereleelrf0eleer0rf1lleer1rfrrlfrxfellel_12_20
This does use the set up – note the pattern won’t continue if more blue balls in the hopper!
This raises a question: What sequences are possible if red always feeds to blue and gears aren’t allowed? It’s easy to show that any finite sequence can be made with just blue switches if there is enough room. But it seems a lot harder to characterize what sequences can be made in the space allowed in the actual physical Turing Tumble.