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 A064931 #15 Aug 01 2023 07:31:40 %S A064931 1,4,5,6,9,10,11,12,21,24,25,29,32,33,34,39,40,49,50,51,54,56,59,60, %T A064931 61,64,65,67,71,72,73,75,76,90,97,99,100,101,102,106,109,110,114,119, %U A064931 120,124,125,129,137,153,176,201,202,210,212,224,228,231,233,236 %N A064931 Numbers m such that the digits of m are also digits of m^3. %C A064931 Presumably if a digit d appears k times in m, then it should appear at least k times in m^3. - _N. J. A. Sloane_, Nov 24 2018 %H A064931 Harvey P. Dale, <a href="/A064931/b064931.txt">Table of n, a(n) for n = 1..1000</a> %e A064931 12^3 = 1728, which contains all digits of 12, so 12 is a term of the sequence. %t A064931 Select[Range[400],Min[DigitCount[#^3]-DigitCount[#]]>-1&] (* _Harvey P. Dale_, Nov 24 2018 *) %Y A064931 Cf. A029776. %K A064931 nonn,base %O A064931 1,2 %A A064931 _Joseph L. Pe_, Feb 14 2002 %E A064931 Corrected and Mathematica program replaced by _Harvey P. Dale_, Nov 24 2018