very slightly relevant: Upon a stack of bits, about so tall, just think, O traveller, what we could do if every other bit was set to false begi

very slightly relevant: Upon a stack of bits, about so tall, just think, O traveller, what we could do if every other bit was set to false beginning with (but not including) two? Now take two lowly numbers, A and B that equal three and two. What would happen if they, by twos and ones respectively, were incremented in a nested fashion, And if we falsified, at every turn, the value offset by A groups of Bs? Then to the aether let those bits return, to fly back home to Eratosthenes! from www.ineptech.com (the "Langston" example)