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 A121322 #12 Nov 02 2021 22:28:57 %S A121322 309,418,462,474,575,635,662,699,702,713,737,746,747,748,765,771,795, %T A121322 838,875,876,892,897,943,945,976,1009,1012,1018,1033,1072,1104,1107, %U A121322 1137,1143,1149,1167,1174,1183,1187,1195,1203,1233,1248,1249,1269,1292 %N A121322 Numbers m such that m^5 contains every digit at least once. %H A121322 T. D. Noe, <a href="/A121322/b121322.txt">Table of n, a(n) for n = 1..10000</a> %e A121322 309^5 = 2817036000549 contains every digit at least once. %t A121322 Select[Range@1500, 1+Union@IntegerDigits@(#^5)==Range@10&] (* _Hans Rudolf Widmer_, Nov 02 2021 *) %o A121322 (PARI) isok(m) = #Set(digits(m^5)) == 10; \\ _Michel Marcus_, Nov 02 2021 %o A121322 (Python) %o A121322 def ok(n): return len(set(str(n**5))) == 10 %o A121322 print([m for m in range(1293) if ok(m)]) # _Michael S. Branicky_, Nov 02 2021 %Y A121322 Cf. A054038 (with m^2), A119735 (with m^3). %K A121322 nonn,base %O A121322 1,1 %A A121322 _Tanya Khovanova_, Aug 25 2006