login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109847 Least common multiple of n and its 9's complement. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(2)=14 because 7=9-2 and lcm(2,7)=14
a(9)=lcm(0,9)=0. a(10)=lcm(89,10)=890.
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 *)
CROSSREFS
Sequence in context: A329499 A220393 A344659 * A260059 A122459 A092537
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Jul 06 2005
EXTENSIONS
Corrected and extended by R. J. Mathar, Mar 27 2006
More terms from Joshua Zucker, May 03 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 06:41 EDT 2024. Contains 372300 sequences. (Running on oeis4.)