Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110807
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110807 n times largest n-digit number. +0
2
0, 9, 198, 2997, 39996, 499995, 5999994, 69999993, 799999992, 8999999991, 99999999990, 1099999999989, 11999999999988, 129999999999987, 1399999999999986, 14999999999999985, 159999999999999984 (list; graph; listen)
OFFSET

0,2

EXAMPLE

a(3) = 3*999 = 2997.

MATHEMATICA

Table[(10^n - 1)*n, {n, 1, 30}] (Steinerberger)

CROSSREFS

Sequence in context: A116877 A081020 A017426 this_sequence A019566 A003026 A064756

Adjacent sequences: A110804 A110805 A110806 this_sequence A110808 A110809 A110810

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 14 2005

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 22 2006

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research