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 #6 Aug 08 2016 15:13:24
%S 1,5,10,11,13,17,22,31,33,50,100,101,103,110,111,112,113,118,122,130,
%T 131,170,202,220,222,233,301,310,327,330,331,332,333,446,500,501,525,
%U 545,565,961,1000,1001,1003,1005,1010,1011,1012,1013,1021,1022,1030,1031
%N Numbers n with property that the square of each digit of n is a substring of n^3
%H Harvey P. Dale, <a href="/A173901/b173901.txt">Table of n, a(n) for n = 1..1000</a>
%t sdsQ[n_]:=Module[{idn3=IntegerDigits[n^3],idn2=IntegerDigits/@ (IntegerDigits[ n]^2)}, And@@Table[SequenceCount[idn3, idn2[[i]]]>0,{i,Length[idn2]}]]; Select[Range[1500],sdsQ] (* The program uses the SequenceCount function from Mathematica version 10 *) (* _Harvey P. Dale_, Aug 08 2016 *)
%K base,nonn
%O 1,2
%A _Claudio Meller_, Mar 01 2010
%E Corrected and extended by _Harvey P. Dale_, Aug 08 2016