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 A373291 #10 May 31 2024 14:13:23
%S A373291 1,32,243,64,25,36,16807,32768,729,100,121,144,169,196,225,256,4913,
%T A373291 5832,361,400,441,234256,529,13824,625,676,729,784,24389,900,961,1024,
%U A373291 35937,39304,1225,1296,1369,54872,59319,1600
%N A373291 Least perfect power of n containing some decimal digit of n.
%C A373291 "Perfect power of n" here means n^k with k>1. The sequence gives the value of n^k, not the value of k. - _N. J. A. Sloane_, May 31 2024
%F A373291 a(n) = n^A253600(n).
%e A373291 For n=12, 12^2=144 contains digit 1 from n so that a(12) = 144.
%t A373291 seq={}; Do[k=1; Until[ ContainsAny[IntegerDigits[n],IntegerDigits[n^k] ],k++ ];AppendTo[seq,n^k] ,{n,40}];seq
%o A373291 (PARI) a(n) = my(sd = Set(vecsort(digits(n))), k=2); while (#setintersect(sd, Set(vecsort(digits(n^k)))) == 0, k++); n^k; \\ _Michel Marcus_, May 31 2024
%Y A373291 Cf. A111442, A253600.
%K A373291 nonn,base
%O A373291 1,2
%A A373291 _James C. McMahon_, May 30 2024