Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110395
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110395 a(1) = 1. a(n) = n times (10's complement of a(n-1)). +0
2
1, 18, 246, 3016, 34920, 390480, 4266640, 45866880, 487198080, 5128019200, 53591788800, 556898534400, 5760319052800, 59355533260800, 609667001088000, 6245327982592000, 63829424295936000, 651070362673152000 (list; graph; listen)
OFFSET

1,2

COMMENT

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.

Adjacent sequences: A110392 A110393 A110394 this_sequence A110396 A110397 A110398

Sequence in context: A081203 A016294 A001713 this_sequence A016183 A016239 A001722

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research