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 A052048 #16 Aug 11 2024 14:42:49
%S A052048 0,1,8,27,64,125,216,512,729,1331,1728,2197,4096,4913,5832,6859,9261,
%T A052048 10648,13824,19683,24389,32768,42875,54872,68921,205379,238328,287496,
%U A052048 328509,389017,421875,438976,592704,681472,804357,912673,2460375,3048625
%N A052048 Cubes whose digits occur with the same frequency.
%H A052048 Nathaniel Johnston, <a href="/A052048/b052048.txt">Table of n, a(n) for n = 1..450</a>
%H A052048 Patrick De Geest, <a href="http://www.worldofnumbers.com/samedigits.htm">Numbers whose digits occur with same frequency</a>
%F A052048 a(n) = A052047(n)^3. - _Andrew Howroyd_, Aug 11 2024
%e A052048 E.g., 238328 = 62^3 -> digits 2, 3 and 8 occur each twice.
%p A052048 isA052048 := proc(n) local d,k,fr,eqfr: if(n=0)then return true: fi: d:=convert(n^3,base,10): eqfr:=true: fr:=numboccur(d[1],d): for k from 0 to 9 do if(not member(numboccur(k,d),{fr,0}))then eqfr:=false: break: fi: od: return eqfr: end: seq(`if`(isA052048(n), n^3, NULL), n=0..200); # _Nathaniel Johnston_, May 31 2011
%t A052048 t={}; Do[If[Length[DeleteDuplicates[Transpose[Tally[IntegerDigits[n^3]]][[2]]]]==1,AppendTo[t,n^3]],{n,0,200}]; t (* _Jayanta Basu_, May 11 2013 *)
%Y A052048 Cf. A052047, A045540, A052046, A052049, A052050, A052051, A052052.
%K A052048 nonn,base
%O A052048 1,3
%A A052048 _Patrick De Geest_, Dec 15 1999
%E A052048 Offset corrected by _Andrew Howroyd_, Aug 11 2024