About Not Quite So Exponential Slow:

This sequence, first described by R. H. Hardin, is closely related to Exponential Slow. It begins like this: 0, 1, 1, 2, 1, 3, 2, 2, 1, 4, 3, 3, 2, 3, 2, 2, 1, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2...

Like Exponential Slow, it can be computed from counting the occurrences of a certain digit in the binary representation of the nth term. But instead of simply operating on the nth term, it operates on something called the twos complement of the nth term -- a common way of representing negative integers in computers. Because of this, the terms in Not Quite So Exponential Slow grow much faster than the other sequences in the Exponential Slow family.

Like the others, this is also a self-similar integer sequence; it contains infinitely many copies of itself and is invariant under scale. If you create a new integer sequence by using every alternate term of this sequence, you end up with exactly the same sequence!

Because of this self-similarity, it "slows down" exponentially as it goes on. It takes longer and longer for "new" numbers to appear as terms. Correspondingly, it takes longer and longer to move forward in the audio file you have selected.

To switch the musical structure to this mode, click on the Change button.

Reference: N. J. A. Sloane, editor (2002), The On-Line Encyclopedia of Integer Sequences, published electronically at http://www.research.att.com/~njas/sequences. Sequence A008687.