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 A252484 #23 Jul 10 2025 14:08:24 %S A252484 1,2,3,4,5,6,9,11,13,14,17,21,23,24,26,27,28,31,36,39,41,46,56,58,61, %T A252484 62,66,68,72,76,82,83,88,91,92,96,121,122,129,137,146,154,161,162,166, %U A252484 167,168,183,186,188,189,211,231,233,244,256,262,264,268,277,278,289,296,337,373,374,376,382,383 %N A252484 Numbers m such that m^k is zeroless for k=1,...,4. %C A252484 See A253110 for the primes in this sequence. See A253644 for the subsequence including k=5. %H A252484 Harvey P. Dale, <a href="/A252484/b252484.txt">Table of n, a(n) for n = 1..1000</a> %p A252484 filter:= proc(n) %p A252484 local j; %p A252484 for j from 0 to 4 do %p A252484 if has(convert(n^j,base,10),0) then return false fi %p A252484 od: %p A252484 true %p A252484 end proc: %p A252484 select(filter, [$1..1000]); # _Robert Israel_, Jan 15 2015 %t A252484 Select[Range[400],Union[DigitCount[#^Range[4],10,0]]=={0}&] (* _Harvey P. Dale_, Aug 01 2020 *) %o A252484 (PARI) is_A252484(n,K=4)=!forstep(k=K,1,-1,vecmin(digits(n^k))||return) %Y A252484 Cf. A052382, A253643 (k <= 3), A253644 (k <= 5), A253645 (primes, k <= 5), A253647 (k <= 6), A253646 (primes, k <= 6), A124648 (k <= 7), A124649 (k <= 8). %Y A252484 Cf. A104264. %K A252484 nonn,base %O A252484 1,2 %A A252484 _M. F. Hasler_, Jan 07 2015