|
%I #18 Aug 15 2022 15:30:55
%S 1,2,10,18,20,22,27,36,63,72,81,100,108,114,117,126,135,141,153,162,
%T 171,180,200,202,207,216,220,261,270,306,315,333,351,360,411,513,531,
%U 603,612,621,630,702,711,720,801,810,1000,1008,1014,1017,1026,1035,1041
%N Numbers such that sum of the digits of the product of the factorial of digits of the number is equal to the sum of the digits of the number.
%D Suggested by _Amarnath Murthy_.
%H Michael S. Branicky, <a href="/A082939/b082939.txt">Table of n, a(n) for n = 1..10000</a>
%F Numbers k such that A007953(k) = A007953(A066459(k)).
%e 63 = 6!*3! = 720*6 = 4320, 4 + 3 + 2 + 0 = 9 and 6 + 3 = 9.
%o (Python)
%o from math import factorial, prod
%o def ok(n):
%o d = list(map(int, str(n)))
%o return sum(map(int, str(prod(map(factorial, d))))) == sum(d)
%o print([k for k in range(1042) if ok(k)]) # _Michael S. Branicky_, Aug 15 2022
%Y Cf. A007953, A066459, A082940.
%K nonn,base
%O 1,2
%A Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 27 2003
%E Corrected and extended by _Jason Earls_, May 22 2004
|
