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 A373203 #20 Jun 01 2024 14:30:10
%S A373203 2,2,5,5,3,2,2,5,5,3,2,2,3,5,4,6,5,5,5,7,5,3,4,7,3,2,8,2,5,3,5,4,3,3,
%T A373203 3,6,6,5,4,3,3,6,7,4,3,4,4,4,4,3,2,3,7,5,3,2,3,5,5,3,2,3,5,2,2,3,2,3,
%U A373203 4,5,5,3,3,3,2,3,2,5,5,5,5
%N A373203 a(n) = minimum k>1 such that n^k contains all distinct decimal digits of n.
%H A373203 Michel Marcus, <a href="/A373203/b373203.txt">Table of n, a(n) for n = 0..10000</a>
%F A373203 A253600(n) <= a(n) <= A045537(n). - _Michael S. Branicky_, May 28 2024
%F A373203 A111442(n) = n^a(n).
%e A373203 For n=12, a(12)=3 because 12^3=1728 contains all decimal digits of n. Compare to A253600(12)=2 because 12^2=144 contains any digit of n.
%t A373203 seq={}; Do[k=1;Until[ContainsAll[IntegerDigits[n^k],IntegerDigits[n] ],k++];AppendTo[seq,k] ,{n,0,80}];seq
%o A373203 (Python)
%o A373203 from itertools import count
%o A373203 def a(n):
%o A373203 s = set(str(n))
%o A373203 return next(k for k in count(2) if s <= set(str(n**k)))
%o A373203 print([a(n) for n in range(81)]) # _Michael S. Branicky_, May 27 2024
%o A373203 (PARI) a(n) = my(k=2, d=Set(digits(n))); while(setintersect(Set(digits(n^k)), d) != d, k++); k; \\ _Michel Marcus_, Jun 01 2024
%Y A373203 Cf. A045537, A111442, A253600.
%K A373203 nonn,base
%O A373203 0,1
%A A373203 _James C. McMahon_, May 27 2024