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 A154875 #17 Aug 19 2025 17:58:52
%S A154875 17824719,17940018,18027474,18197931,18326025,18798396,18915888,
%T A154875 18929424,19027455,19149462,19180275,19196064,19235673,19311297,
%U A154875 19322913,19324275,19328322,19455918,19522575,19757886,19793664
%N A154875 Numbers k such that k^4 contains every digit exactly 3 times.
%H A154875 Harvey P. Dale, <a href="/A154875/b154875.txt">Table of n, a(n) for n = 1..172</a>
%e A154875 22807116 ^ 4 = 270571148920443982076865351936, which contains exactly 3 times of each digit 0-9.
%t A154875 Select[Range[17824000,31608000],Union[Tally[IntegerDigits[#^4]][[All,2]]]=={3}&] (* _Harvey P. Dale_, Dec 24 2016 *)
%o A154875 (PARI) is(n) = my(v=vector(10), d=digits(n^4)); if(#d!=30,return(0)); for(i=1, #d, v[d[i]+1]++; if(v[d[i]+1] > 3, return(0))); 1 \\ _David A. Corneth_, Aug 19 2025
%Y A154875 Cf. A054038, A074205, A154532, A154566, A154871, A154873, A154874.
%K A154875 nonn,easy,base,fini,full
%O A154875 1,1
%A A154875 _Zhining Yang_, Jan 16 2009