a(n) = smallest integer s such that for all i, all primes p and all m the congruence (x_1)^n + ... + (x_s)^n == m (mod p^i) has a primitive solution.
A040004
a(n) = smallest integer s such that for all i, all primes p and all m the congruence (x_1)^n + ... + (x_s)^n == m (mod p^i) has a primitive solution.
Terms
- a(0) =1a(1) =4a(2) =4a(3) =16a(4) =5a(5) =9a(6) =4a(7) =32a(8) =13a(9) =12a(10) =11a(11) =16a(12) =6a(13) =14a(14) =15a(15) =64a(16) =6a(17) =27a(18) =4a(19) =25a(20) =24a(21) =23a(22) =23a(23) =32a(24) =10a(25) =26a(26) =40a(27) =29a(28) =29a(29) =31
External references
- oeis: A040004