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.

A109847 Least common multiple of n and its 9's complement.

Original entry on oeis.org

8, 14, 6, 20, 20, 6, 14, 8, 0, 890, 88, 348, 1118, 1190, 420, 1328, 1394, 162, 1520, 1580, 546, 154, 1748, 600, 1850, 1898, 216, 1988, 2030, 690, 2108, 2144, 66, 2210, 2240, 252, 2294, 2318, 780, 2360, 2378, 798, 2408, 220, 270, 2438, 2444, 816, 2450, 2450
Offset: 1

Views

Author

Amarnath Murthy, Jul 06 2005

Keywords

Examples

			a(2)=14 because 7=9-2 and lcm(2,7)=14
a(9)=lcm(0,9)=0. a(10)=lcm(89,10)=890.
		

Crossrefs

Programs

  • Maple
    digs := proc(inp::integer) local resul,shiftinp : resul := 1 : shiftinp := iquo(inp,10) : while shiftinp > 0 do resul := resul+1 : shiftinp := iquo(shiftinp,10) : od : RETURN(resul) : end: nin := proc(inp::integer) RETURN(10^digs(inp)-1-inp) : end : for n from 1 to 40 do comp := nin(n) ; #print(n,comp,lcm(n,comp)) ; printf("%d,",lcm(n,comp)) ; od : # R. J. Mathar, Mar 27 2006
    # second Maple program:
    a:= n-> ilcm((10^length(n)-1-n), n):
    seq(a(n), n=1..100);  # Alois P. Heinz, Sep 22 2015
  • Mathematica
    Array[LCM[#,10^IntegerLength[#]-1-#]&,50] (* Harvey P. Dale, Apr 17 2012 *)

Extensions

Corrected and extended by R. J. Mathar, Mar 27 2006
More terms from Joshua Zucker, May 03 2006