Approach: The numbers are consecutive odd numbers, and the sum of the first \(n\) odd numbers is the clean perfect square \(n^2\). That single fact turns the whole problem into a tiny quadratic.
Step 1: List the sequence \(1, 3, 5, \ldots, 57\). General term \(a_n = 2n-1\). Since \(2N-1 = 57\), there are \(N = 29\) terms, and the total sum is \(1+3+\cdots+57 = 29^2 = 841\).
Step 2: Let \(k\) be the \(m\)-th term, so the terms before \(k\) are the first \(m-1\) odd numbers, summing to \((m-1)^2\). The terms after \(k\) sum to (total) minus (first \(m\) terms) \(= 841 - m^2\).
Step 3: The condition "sum before \(k\) = sum after \(k\)" gives \[ (m-1)^2 = 841 - m^2. \] Expand: \(m^2 - 2m + 1 = 841 - m^2\), so \(2m^2 - 2m - 840 = 0\), i.e. \(m^2 - m - 420 = 0\).
Step 4: Factor: \((m-21)(m+20)=0\), so \(m = 21\) (reject \(m=-20\)).
Step 5: \(k = a_{21} = 2(21)-1 = 41.\)
Answer: \(\boxed{k = 41}\).