This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A109135 #8 Mar 31 2012 10:26:04 %S A109135 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 A109135 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 A109135 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 A109135 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 A109135 a(n)=0 for n=1(mod 4)=A016813. %C A109135 a(4k+1) = 0. All other zeros are unproved and have been checked up to m = 1000. - _David Wasserman_, May 27 2008 %D A109135 H. Ibstedt, Solution to Problem 2623, "Exclusionary Powers", pp. 346-9 Journal of Recreational Mathematics, Vol. 32 No.4 2003-4 Baywood NY. %Y A109135 Cf. A113951. %K A109135 less,nonn,base %O A109135 2,2 %A A109135 _Lekraj Beedassy_, Aug 17 2005 %E A109135 More terms from _David Wasserman_, May 27 2008