Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Aug 01 2023 07:31:40
%S 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 61,64,65,67,71,72,73,75,76,90,97,99,100,101,102,106,109,110,114,119,
%U 120,124,125,129,137,153,176,201,202,210,212,224,228,231,233,236
%N Numbers m such that the digits of m are also digits of m^3.
%C 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 Harvey P. Dale, <a href="/A064931/b064931.txt">Table of n, a(n) for n = 1..1000</a>
%e 12^3 = 1728, which contains all digits of 12, so 12 is a term of the sequence.
%t Select[Range[400],Min[DigitCount[#^3]-DigitCount[#]]>-1&] (* _Harvey P. Dale_, Nov 24 2018 *)
%Y Cf. A029776.
%K nonn,base
%O 1,2
%A _Joseph L. Pe_, Feb 14 2002
%E Corrected and Mathematica program replaced by _Harvey P. Dale_, Nov 24 2018