|
%I #28 Feb 08 2024 07:19:28
%S 1,2,3,4,5,6,7,8,9,11,12,15,111,112,115,315,612,1111,1112,1113,1115,
%T 1116,11111,11112,11115,12312,13212,21312,23112,31212,32112,111111,
%U 111112,111115,111315,111612,113115,116112,131115,161112,311115,511175
%N Numbers that are multiples of their digital product, where this digital product also appears as their least significant digits.
%C Subsequence of A007602. [_R. J. Mathar_, Nov 12 2009]
%H Karl-Heinz Hofmann, <a href="/A167620/b167620.txt">Table of n, a(n) for n = 1..8042</a> (first 690 terms from David A. Corneth, terms < 10^18)
%e 612 is in the list because 6*1*2=12, 612 is a multiple of 12, and 12 is the final two digits of 612.
%o (PARI) is(n) = { my(vp = vecprod(digits(n))); vp != 0 && n %vp == 0 && n % 10^(#digits(vp)) == vp } \\ _David A. Corneth_, Mar 30 2021
%o (Python)
%o A167620 = []
%o for k in range(1,511176):
%o dprod, k_str = 1, str(k)
%o for d in range(0,len(k_str)): dprod *= int(k_str[d])
%o if dprod != 0 and k % dprod == 0 and str(dprod) == k_str[-(len(str(dprod))):]:
%o A167620.append(k)
%o print(A167620) # _Karl-Heinz Hofmann_, Jan 26 2024
%Y Cf. A007602.
%K nonn,base
%O 1,2
%A _Claudio Meller_, Nov 07 2009
|
