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 #13 Sep 08 2022 08:45:13
%S 1,2,10,12,21,32,104,111,112,120,145,200,220,222,224,341,403,441,1000,
%T 1020,1100,1120,1122,1200,1204,1210,1212,1230,1232,1320,1330,2000,
%U 2010,2030,2100,2110,2112,2123,2125,2130,2204,2212,2232,2250,2300,2310,2321
%N Numbers that are divisible by the sum of the factorials of their digits.
%H Amiram Eldar, <a href="/A093325/b093325.txt">Table of n, a(n) for n = 1..10000</a>
%e 104 is a term because 1!+0!+4!=26 and 104/26=4.
%t seqQ[n_] := Divisible[n, Total@(Factorial /@ IntegerDigits[n])]; Select[Range[2500], seqQ] (* _Amiram Eldar_, Dec 16 2019 *)
%o (Magma) f:=func< n|&+[Factorial(Intseq(n)[i]):i in [1..#Intseq(n)]]>; [k:k in [1..2500]| k mod f(k) eq 0]; // _Marius A. Burtea_, Dec 16 2019
%Y Cf. A005349, A061602.
%K base,easy,nonn
%O 1,2
%A _Jason Earls_, May 11 2004