In how many ways can the integers from $1$ to $n$ be ordered subject to the condition that, except for the first integer on the left, every integer differs by $1$ from some integer to the left of it?
1. Let's consider the integers from $1$ to $n$ and the condition that, except for the first integer on the left, every integer differs by $1$ from some integer to the left of it. This means that each integer in the sequence must be either one more or one less than some integer that appears before it.

2. Suppose the first integer in the sequence is $k$. Then, the integers $k-1, k-2, \dots, 1$ must appear in that order, and the integers $k+1, k+2, \dots, n$ must also appear in that order. This is because each integer must differ by $1$ from some integer to the left of it, so the sequence must be built incrementally by adding or subtracting $1$.

3. We need to determine the number of ways to choose the direction (either "up" or "down") for each of the $n-1$ steps after the first integer. Since we start with $k$, we will have $k-1$ "down" steps (to reach $1$) and $n-k$ "up" steps (to reach $n$).

4. The number of ways to choose $k-1$ "down" steps out of $n-1$ total steps is given by the binomial coefficient ${n-1 \choose k-1}$.

5. Summing over all possible starting integers $k$ from $1$ to $n$, we get the total number of possible sequences:
   \[
   \sum_{k=1}^{n} {n-1 \choose k-1}
   \]

6. Using the identity for binomial coefficients, we know that:
   \[
   \sum_{k=0}^{n-1} {n-1 \choose k} = 2^{n-1}
   \]
   Since ${n-1 \choose k-1}$ is just a reindexing of ${n-1 \choose k}$, the sum from $k=1$ to $n$ is equivalent to the sum from $k=0$ to $n-1$.

7. Therefore, the total number of possible sequences is:
   \[
   \sum_{k=1}^{n} {n-1 \choose k-1} = \sum_{k=0}^{n-1} {n-1 \choose k} = 2^{n-1}
   \]

The final answer is $\boxed{2^{n-1}}$