|
%I #23 Aug 15 2022 05:23:23
%S 1,2,3,4,5,6,7,8,9,10,11,84,31,574,255,488,71,162,91,20,84,22,32,168,
%T 260,62,72,1148,92,510,13,11224,33,6106,1855,2268,73,15106,93,40,14,
%U 6888,34,44,4590,64,74,10248,658,260,1065,3100,35,3240,55,149240,6825,7820,95,7140,16,26,252,11224,8680,66,76,12212,96,152110,17,4536,37,6862,251940,2024204,77
%N Least common multiple of reversals of divisors of n in decimal representation.
%H Reinhard Zumkeller, <a href="/A188649/b188649.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%F a(A000040(n)) = A004087(n);
%F a(A002385(n)) = A002385(n), see A188650 for all fixed points.
%e Divisors(42) = {1,2,3,6,7,14,21,42}, therefore a(42) = lcm(1,2,3,6,7,41,12,24) = 6888.
%o (Haskell)
%o a188649 n = foldl lcm 1 $ map a004086 $ filter ((== 0) . mod n) [1..n]
%o (PARI) a(n) = lcm(apply(x->fromdigits(Vecrev(digits(x))), divisors(n))); \\ _Michel Marcus_, Mar 13 2018
%o (Python)
%o from math import lcm
%o from sympy import divisors
%o def a(n): return lcm(*(int(str(d)[::-1]) for d in divisors(n)))
%o print([a(n) for n in range(1, 78)]) # _Michael S. Branicky_, Aug 14 2022
%Y Cf. A003990 (LCM), A027750 (divisors), A004086 (reversal), A188650.
%Y Cf. A000040, A004087, A002385.
%K nonn,base
%O 1,2
%A _Reinhard Zumkeller_, Apr 11 2011
|
