Find the number of permutations of $\{1,2,...,n\}$ like $\{a_1,...,a_n\}$ st for each $1 \leq i \leq n$:
$$a_i | 2i$$
1. **Identify the groups:**
   For each odd \( i \) with \( 1 \leq i \leq n \), consider the numbers of the form \( \{2^k \cdot i \mid k \geq 0\} \cap \mathbb{Z}_{\leq n} \). These numbers form a group where each element is a multiple of \( i \) and a power of 2.

2. **Group properties:**
   Any permutation satisfying the condition \( a_i \mid 2i \) must permute the numbers within each group. This is because the largest odd part of any number in the group must remain fixed under the permutation, and the same applies to the next smallest odd part, and so on.

3. **Counting permutations within a group:**
   If there are \( m \) numbers in a group, there are \( 2^{m-1} \) ways to permute them. This is because we can form disjoint cycles of the form:
   \[
   (2^{m-1} \cdot i \to 2^{m-2} \cdot i \to \cdots \to 2^{l} \cdot i \to 2^{m-1} \cdot i), (2^{l-1} \cdot i \to 2^{l-2} \cdot i \to \cdots \to 2^{l-1} \cdot i), \cdots
   \]
   This is equivalent to splitting the row of \( m \) items into contiguous blocks, i.e., placing dividers between the numbers, resulting in \( 2^{m-1} \) ways.

4. **Total number of groups:**
   There are \( \lceil n/2 \rceil \) groups because each group is formed by considering the odd numbers \( 1, 3, 5, \ldots, \) up to the largest odd number less than or equal to \( n \).

5. **Total permutations:**
   Each group's ordering can be assigned independently. Therefore, the total number of permutations is:
   \[
   2^{n - \lceil n/2 \rceil} = 2^{\lfloor n/2 \rfloor}
   \]

The final answer is \( \boxed{ 2^{\lfloor n/2 \rfloor} } \).