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? Please provide the number of ways for $n = 6$.

Let's think step by step and output the final answer within \boxed{}.
user