%I A113951
%S A113951 639172,7658,2673,0,92,93,712,0,18,12,4,0,37,0,9,0,0,3,4,0,7,2,7,0,8,3,
%T A113951 9,0,0,0,0,0,2,2,2,0,0,2,0,0,2
%N A113951 Largest number whose n-th power is exclusionary (or 0 if no such number 
               exists).
%C A113951 The number m with no repeated digits has an exclusionary n-th power m^n 
               if the latter is made up of digits not appearing in m. For the corresponding 
               m^n see A113952. In principle, no exclusionary n-th power exists 
               for n=1(mod 4)=A016813.
%D A113951 H. Ibstedt, Solution to Problem 2623, "Exclusionary Powers", pp. 346-9 
               Journal of Recreational Mathematics, Vol. 32 No.4 2003-4 Baywood 
               NY.
%e A113951 a(4)=2673 because no number with distinct digits beyond 2673 has a 4-th 
               power that shares no digit in common with it (see A111116). Here 
               we have 2673^4=51050010415041.
%Y A113951 Cf. A109135; A112736, A112994, A113318.
%Y A113951 Sequence in context: A141815 A048924 A066590 this_sequence A089220 A052243 
               A102810
%Y A113951 Adjacent sequences: A113948 A113949 A113950 this_sequence A113952 A113953 
               A113954
%K A113951 base,nonn
%O A113951 2,1
%A A113951 Lekraj Beedassy (blekraj(AT)yahoo.com), Nov 09 2005