Let $\triangle ABC$ have median $CM$ ($M\in AB$) and circumcenter $O$. The circumcircle of $\triangle AMO$ bisects $CM$. Determine the least possible perimeter of $\triangle ABC$ if it has integer side lengths.
1. **Claim: \(AC = CM\)**

   **Proof 1:**
   - Let the midpoint of \(CM\) be point \(N\).
   - Since \(\angle OMA = 90^\circ\) and \(N \in (AMO)\), this means that \(\angle ONA = 90^\circ\).
   - If \(\overline{AN} \cap (ABC) = X\), since \(ON \perp AN\), this implies that \(N\) is the midpoint of \(AX\).
   - Now \(NA = NX\) and \(NC = NM\), so \(ACXM\) is a parallelogram.
   - Therefore, \(\angle CAM = \angle CAX + \angle XAM = \angle CBX + \angle CXA = \angle CBX + \angle CBA = \angle ABX = \angle AMN = \angle AMC \Rightarrow CA = CM\).

   **Proof 2:**
   - Let \(S\) be the midpoint of \(AC\).
   - Now \(AMONS\) is cyclic, but \(SN\) is a midsegment in \(\triangle AMC\), so \(SN \parallel AM\) and \(AMNS\) is cyclic.
   - Therefore, \(AMNS\) is an isosceles trapezoid.
   - Now \(AS = NM \Rightarrow CA = CM\).

2. **Using the median formula:**
   - Let \(a = BC\), \(b = AC = CM\), \(c = AB\).
   - The median formula is given by \(m_c = \frac{1}{2}\sqrt{2a^2 + 2b^2 - c^2}\).
   - Since \(b^2 = CM^2 = \frac{1}{4}(2a^2 + 2b^2 - c^2)\), we get:
     \[
     b^2 = \frac{1}{4}(2a^2 + 2b^2 - c^2) \Rightarrow 4b^2 = 2a^2 + 2b^2 - c^2 \Rightarrow 2b^2 = 2a^2 - c^2 \Rightarrow c^2 = 2(a^2 - b^2)
     \]
     \[
     c^2 = 2(a - b)(a + b)
     \]

3. **Finding integer side lengths with minimal perimeter:**
   - We want \(a, b, c\) to be positive integers with minimal sum (the perimeter of \(\triangle ABC\)).
   - If \(\gcd(a, b) = d > 1\), then \(\left(\frac{a}{d}, \frac{b}{d}, \frac{c}{d}\right)\) are the side lengths of a triangle which satisfies the conditions in the problem with a smaller perimeter.
   - Thus, we can assume that \(a, b, c\) are pairwise coprime.

4. **Case 1: \(a - b = 2s^2\), \(a + b = 4t^2\) for positive integers \(s, t\):**
   - Then \(a = s^2 + 2t^2\), \(b = 2t^2 - s^2\), \(c = 4st\).
   - The perimeter is \(4t^2 + 4st\).
   - If \(s = 1, t = 1\), we get \((a, b, c) = (3, 1, 4)\), impossible.
   - If \(s = 1, t = 2\), then \((a, b, c) = (9, 7, 8)\), so the least possible perimeter in this case is \(24\).

5. **Case 2: \(a - b = 4s^2\), \(a + b = 2t^2\) for positive integers \(s, t\):**
   - Then \(a = 2s^2 + t^2\), \(b = t^2 - 2s^2\), \(c = 4st\).
   - The perimeter is \(2t^2 + 4st\).
   - If \(s = 1, t = 2\), we get \((a, b, c) = (6, 2, 8)\), impossible.
   - If \(s = 1, t = 3\), then \((a, b, c) = (11, 7, 12)\), so the least possible perimeter in this case is \(30\).

6. **Conclusion:**
   - In both cases, the minimal perimeter is achieved when \((a, b, c) = (9, 7, 8)\) with a perimeter of \(24\).

The final answer is \(\boxed{24}\)