Let ${(a_n)_{n\ge1}} $ be a sequence with  ${a_1 = 1} $  and  ${a_{n+1} = \lfloor a_n +\sqrt{a_n}+\frac{1}{2}\rfloor }$ for all ${n \ge 1}$, where ${\lfloor x \rfloor}$ denotes the greatest integer less than or equal to ${x}$. Find all ${n \le 2013}$ such that ${a_n}$ is a perfect square
1. **Initial Condition and Recurrence Relation:**
   We start with the initial condition \( a_1 = 1 \). The recurrence relation is given by:
   \[
   a_{n+1} = \lfloor a_n + \sqrt{a_n} + \frac{1}{2} \rfloor
   \]
   where \( \lfloor x \rfloor \) denotes the greatest integer less than or equal to \( x \).

2. **Understanding the Recurrence Relation:**
   To understand the behavior of the sequence, let's analyze the expression inside the floor function:
   \[
   a_n + \sqrt{a_n} + \frac{1}{2}
   \]
   For any positive integer \( a_n \), \( \sqrt{a_n} \) is a non-negative real number. Adding \( \frac{1}{2} \) ensures that the expression \( a_n + \sqrt{a_n} + \frac{1}{2} \) is not an integer unless \( \sqrt{a_n} \) itself is an integer.

3. **Checking for Perfect Squares:**
   Suppose \( a_n \) is a perfect square, say \( a_n = k^2 \) for some integer \( k \). Then:
   \[
   a_{n+1} = \lfloor k^2 + k + \frac{1}{2} \rfloor
   \]
   Since \( k^2 + k + \frac{1}{2} \) is not an integer (because \( k^2 + k \) is an integer and adding \( \frac{1}{2} \) makes it a non-integer), the floor function will reduce it to:
   \[
   a_{n+1} = k^2 + k
   \]
   Now, we need to check if \( k^2 + k \) can be a perfect square. Let \( k^2 + k = m^2 \) for some integer \( m \). This implies:
   \[
   k^2 + k - m^2 = 0
   \]
   This is a quadratic equation in \( k \):
   \[
   k^2 + k - m^2 = 0
   \]
   Solving for \( k \) using the quadratic formula:
   \[
   k = \frac{-1 \pm \sqrt{1 + 4m^2}}{2}
   \]
   For \( k \) to be an integer, \( 1 + 4m^2 \) must be a perfect square. Let \( 1 + 4m^2 = t^2 \) for some integer \( t \). Then:
   \[
   t^2 - 4m^2 = 1
   \]
   This is a Diophantine equation known as the Pell's equation. The fundamental solution to this equation is \( t = 3 \) and \( m = 1 \), leading to the sequence of solutions \( t_n \) and \( m_n \) given by the recurrence relations:
   \[
   t_{n+1} = 3t_n + 4m_n
   \]
   \[
   m_{n+1} = 2t_n + 3m_n
   \]
   However, for our purposes, we only need to check the initial values. The smallest solution \( t = 3 \) and \( m = 1 \) gives:
   \[
   k = \frac{-1 \pm 3}{2}
   \]
   This yields \( k = 1 \) or \( k = -2 \). Since \( k \) must be positive, we have \( k = 1 \).

4. **Conclusion:**
   For \( k = 1 \), we have \( a_1 = 1 \). For \( n > 1 \), the sequence \( a_n \) will not be a perfect square because \( k^2 + k \) for \( k > 1 \) is not a perfect square. Therefore, the only \( n \leq 2013 \) such that \( a_n \) is a perfect square is \( n = 1 \).

The final answer is \( \boxed{ n = 1 } \).