The NIMO problem writers have invented a new chess piece called the [i]Oriented Knight[/i].  This new chess piece has a limited number of moves: it can either move two squares to the right and one square upward or two squares upward and one square to the right.  How many ways can the knight move from the bottom-left square to the top-right square of a $16\times 16$ chess board?

[i] Proposed by Tony Kim and David Altizio [/i]
1. **Understanding the Moves**:
   - The Oriented Knight can move in two ways:
     1. Two squares to the right and one square upward.
     2. Two squares upward and one square to the right.
   - Each move changes the knight's position by either $(2, 1)$ or $(1, 2)$.

2. **Determining the Total Moves**:
   - To move from the bottom-left to the top-right of a $16 \times 16$ chessboard, the knight must cover a total distance of 16 squares both horizontally and vertically.
   - Each $(2, 1)$ move increases the horizontal position by 2 and the vertical position by 1.
   - Each $(1, 2)$ move increases the horizontal position by 1 and the vertical position by 2.

3. **Setting Up the Equations**:
   - Let $x$ be the number of $(2, 1)$ moves.
   - Let $y$ be the number of $(1, 2)$ moves.
   - We need to satisfy the following equations:
     \[
     2x + y = 16 \quad \text{(horizontal movement)}
     \]
     \[
     x + 2y = 16 \quad \text{(vertical movement)}
     \]

4. **Solving the System of Equations**:
   - Multiply the second equation by 2:
     \[
     2x + 4y = 32
     \]
   - Subtract the first equation from this result:
     \[
     (2x + 4y) - (2x + y) = 32 - 16
     \]
     \[
     3y = 16
     \]
     \[
     y = \frac{16}{3} \quad \text{(not an integer, so no solution)}
     \]

5. **Revisiting the Problem**:
   - The initial solution suggests a different approach, implying a misinterpretation of the problem constraints.
   - Instead, consider the total number of moves required to reach the top-right corner:
     - We need to move 15 squares up and 15 squares right.
     - Each $(2, 1)$ move contributes 2 right and 1 up.
     - Each $(1, 2)$ move contributes 1 right and 2 up.

6. **Correcting the Approach**:
   - Let $a$ be the number of $(2, 1)$ moves.
   - Let $b$ be the number of $(1, 2)$ moves.
   - We need to satisfy:
     \[
     2a + b = 15 \quad \text{(horizontal movement)}
     \]
     \[
     a + 2b = 15 \quad \text{(vertical movement)}
     \]

7. **Solving the Correct System of Equations**:
   - Multiply the second equation by 2:
     \[
     2a + 4b = 30
     \]
   - Subtract the first equation from this result:
     \[
     (2a + 4b) - (2a + b) = 30 - 15
     \]
     \[
     3b = 15
     \]
     \[
     b = 5
     \]
   - Substitute $b = 5$ back into the first equation:
     \[
     2a + 5 = 15
     \]
     \[
     2a = 10
     \]
     \[
     a = 5
     \]

8. **Counting the Sequences**:
   - We need 5 $(2, 1)$ moves and 5 $(1, 2)$ moves.
   - The total number of ways to arrange these moves is given by the binomial coefficient:
     \[
     \binom{10}{5} = \frac{10!}{5!5!} = 252
     \]

Conclusion:
\[
\boxed{252}
\]