cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A052429 Least common multiple of nonzero digits of n.

This page as a plain text file.
%I A052429 #14 Aug 18 2019 16:37:45
%S A052429 1,2,3,4,5,6,7,8,9,1,1,2,3,4,5,6,7,8,9,2,2,2,6,4,10,6,14,8,18,3,3,6,3,
%T A052429 12,15,6,21,24,9,4,4,4,12,4,20,12,28,8,36,5,5,10,15,20,5,30,35,40,45,
%U A052429 6,6,6,6,12,30,6,42,24,18,7,7,14,21,28,35,42,7,56,63,8,8,8,24,8,40,24,56
%N A052429 Least common multiple of nonzero digits of n.
%H A052429 Robert Israel, <a href="/A052429/b052429.txt">Table of n, a(n) for n = 1..10000</a>
%e A052429 a(46)=12 because least common multiple of 4 and 6 is 12.
%p A052429 f:= proc(n)
%p A052429   ilcm(op(subs(0=NULL, convert(n,base,10))))
%p A052429 end proc:
%p A052429 map(f, [$1..100]); # _Robert Israel_, Mar 11 2018
%t A052429 lcmnzd[n_]:=Module[{d=Select[IntegerDigits[n],#>0&]},LCM@@d]; lcmnzd/@ Range[90] (* _Harvey P. Dale_, Jul 13 2016 *)
%Y A052429 Cf. A007954.
%K A052429 base,easy,nonn
%O A052429 1,2
%A A052429 _Henry Bottomley_, Mar 17 2000