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 A052047 #17 Aug 11 2024 14:41:32
%S A052047 0,1,2,3,4,5,6,8,9,11,12,13,16,17,18,19,21,22,24,27,29,32,35,38,41,59,
%T A052047 62,66,69,73,75,76,84,88,93,97,135,145,203,289,297,302,303,319,888,
%U A052047 1412,1694,2078,4755,5399,6181,6274,6443,9078,9413,9709,22111,22819
%N A052047 Numbers k such that the digits of k^3 occur with the same frequency.
%H A052047 Robert Israel, <a href="/A052047/b052047.txt">Table of n, a(n) for n = 1..500</a>
%H A052047 P. De Geest, <a href="https://www.worldofnumbers.com/samedigits.htm">Numbers whose digits occur with same frequency</a>
%p A052047 filter:= proc(n) local L,V,k;
%p A052047 L:= convert(n^3,base,10);
%p A052047 V:= {seq(numboccur(k,L),k=0..9)};
%p A052047 nops(V minus {0}) = 1
%p A052047 end proc:filter(0):= true:select(filter, [$0..10000]); # _Robert Israel_, Mar 12 2020
%t A052047 t={}; Do[If[Length[DeleteDuplicates[Transpose[Tally[IntegerDigits[n^3]]][[2]]]]==1,AppendTo[t,n]],{n,0,23000}]; t (* _Jayanta Basu_, May 11 2013 *)
%t A052047 Select[Range[0,23000],Length[Union[DeleteCases[DigitCount[#^3],0]]]==1&] (* _Harvey P. Dale_, Jun 14 2020 *)
%Y A052047 Cf. A052048, A045540, A052046, A052049, A052050, A052051, A052052.
%K A052047 nonn,base
%O A052047 1,3
%A A052047 _Patrick De Geest_, Dec 15 1999