login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110395 a(1) = 1. a(n) = n times (10's complement of a(n-1)). 1
1, 18, 246, 3016, 34920, 390480, 4266640, 45866880, 487198080, 5128019200, 53591788800, 556898534400, 5760319052800, 59355533260800, 609667001088000, 6245327982592000, 63829424295936000, 651070362673152000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(1)=1; a(n)=n*[10...0 - a(n-1)] for n>1 (00...0 and a[n-1] have the same number of digits). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 31 2005

EXAMPLE

a(4) = 4* 10's complement of a(3) = 4*(1000-246) = 3016.

MAPLE

s:=proc(m) nops(convert(m, base, 10)) end: a[1]:=1: for n from 2 to 21 do a[n]:=n*(10^s(a[n-1])-a[n-1]) od: seq(a[n], n=1..21); (Deutsch)

CROSSREFS

Cf. A110394.

Sequence in context: A016294 A153593 A001713 * A153600 A016183 A016239

Adjacent sequences:  A110392 A110393 A110394 * A110396 A110397 A110398

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 29 2005

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 31 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 20:07 EST 2012. Contains 205956 sequences.