The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 Mar 31 2012 10:26:04
%S 0,2,2,2,0,2,3,3,0,3,3,2,0,2,0,2,0,0,3,2,0,2,2,7,0,2,3,3,0,0,0,0,0,2,
%T 2,2,0,0,2,3,0,2,0,0,0,2,0,0,0,3,0,0,0,2,3,0,0,0,0,0,0,0,0,2,0,0,0,0,
%U 0,0,0,0,0,2,0,0,0,0,0,0,0,0,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N Least number whose n-th power is exclusionary (or 0 if no such n exists). An exclusionary n-th power m^n is one made up of digits not appearing in m, which itself consists of distinct digits.
%C a(n)=0 for n=1(mod 4)=A016813.
%C a(4k+1) = 0. All other zeros are unproved and have been checked up to m = 1000. - _David Wasserman_, May 27 2008
%D H. Ibstedt, Solution to Problem 2623, "Exclusionary Powers", pp. 346-9 Journal of Recreational Mathematics, Vol. 32 No.4 2003-4 Baywood NY.
%Y Cf. A113951.
%K less,nonn,base
%O 2,2
%A _Lekraj Beedassy_, Aug 17 2005
%E More terms from _David Wasserman_, May 27 2008