|
%I #16 May 24 2017 09:12:23
%S 1,2,10,11,12,20,30,100,101,102,110,111,112,120,132,200,210,212,220,
%T 240,300,312,1000,1001,1002,1010,1011,1012,1020,1032,1100,1101,1102,
%U 1104,1110,1111,1112,1120,1200,1210,1212,1220,1320,2000,2010,2012,2020,2100,2110,2112
%N Numbers m that are divisible by the product of the factorials of their digits in base 10.
%H Reinhard Zumkeller, <a href="/A188264/b188264.txt">Table of n, a(n) for n = 1..1000</a>
%e Number 30 is in sequence because 30 is divisible by the product of factorials 3!*0! = 6.
%t Select[Range[2200],Divisible[#,Times@@(IntegerDigits[#]!)]&] (* _Harvey P. Dale_, May 24 2017 *)
%o (Haskell)
%o import Data.List (elemIndices)
%o a188264 n = a188264_list !! (n-1)
%o a188264_list =
%o map (+ 1) $ elemIndices 0 $ zipWith mod [1..] $ map a066459 [1..]
%o -- _Reinhard Zumkeller_, Oct 11 2011
%Y Cf. A061602, A066459, A093325.
%Y Cf. A066459, A000142, A197181.
%K nonn,base
%O 1,2
%A _Jaroslav Krizek_, Mar 25 2011
|
