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 A020667 #18 Dec 05 2024 07:27:46 %S A020667 1023456789,1026753849,12584301976,338920744561,2817036000549, %T A020667 16157819263041,1727094849536,13685690504052736,1628413597910449, %U A020667 3656158440062976,2384185791015625,129746337890625,1490116119384765625,168377826559400929,2862423051509815793 %N A020667 Least n-th power containing every digit. %C A020667 It is extremely probable that a(n) = 2^n for all n >= 169. %H A020667 Seiichi Manyama, <a href="/A020667/b020667.txt">Table of n, a(n) for n = 1..3321</a> %F A020667 a(n) = A020666(n)^n. - _Seiichi Manyama_, Dec 05 2024 %o A020667 (Python) %o A020667 def a(n): %o A020667 if n == 1: return 1023456789 %o A020667 a020667n = 2 %o A020667 while not(len(set(str(a020667n**n))) == 10): a020667n += 1 %o A020667 return a020667n**n %o A020667 print([a(n) for n in range(1, 16)]) # _Michael S. Branicky_, Jul 04 2021 %Y A020667 Cf. A020666, A137214. %K A020667 nonn,base %O A020667 1,1 %A A020667 _David W. Wilson_