%I A040004
%S A040004 4,16,5,9,4,32,13,12,11,16,6,14,15,64,6,27,4,25,24,23,23,32,10,26,40,
%T A040004 29,29,30,5,128
%N A040004 Minimal solution of a congruence.
%C A040004 a(k) = smallest integer s such that for all n, all primes p and all m>
               0 the congruence (x_1)^k + ... + (x_s)^k == s (mod p^n) has a solution 
               in which not all x_i are all 0 (mod p).
%D A040004 G. H. Hardy, Collected Papers. Vols. 1-, Oxford Univ. Press, 1966-; see 
               vol. 1, p. 466.
%Y A040004 Sequence in context: A010295 A059152 A059156 this_sequence A050080 A110651 
               A115054
%Y A040004 Adjacent sequences: A040001 A040002 A040003 this_sequence A040005 A040006 
               A040007
%K A040004 nonn
%O A040004 3,1
%A A040004 Simon Plouffe (simon.plouffe(AT)gmail.com).