Congruences for \(r_s(n)\) modulo \(2s\) (Q2469151)

Let \(r_s(n)\) denote the number of ways to write \(n\) as the sum of \(s\) squares of integers. The author determines \(r_s(n)\) modulo \(2s\) when \(s\) is a prime or a power of 2. For general \(s\), he proves a congruence for \(r_s(n)\) modulo the largest power of 2 dividing \(2s\). The author also remarks that tables of \(r_s(n)\) suggest that his theorems above describe all congruences modulo a divisor of \(2s\) satisfied by \(r_s(n)\) for all \(n > 0\).