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.

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Henry Bottomley, Mar 17 2000

Keywords

Examples

			a(46)=12 because least common multiple of 4 and 6 is 12.
		

Crossrefs

Cf. A007954.

Programs

  • Maple
    f:= proc(n)
      ilcm(op(subs(0=NULL, convert(n,base,10))))
    end proc:
    map(f, [$1..100]); # Robert Israel, Mar 11 2018
  • Mathematica
    lcmnzd[n_]:=Module[{d=Select[IntegerDigits[n],#>0&]},LCM@@d]; lcmnzd/@ Range[90] (* Harvey P. Dale, Jul 13 2016 *)