|
Search: id:A113119
|
|
|
| A113119 |
|
Total number of digits in all n-digit nonnegative integers. |
|
+0
1
|
|
| 10, 180, 2700, 36000, 450000, 5400000, 63000000, 720000000, 8100000000, 90000000000, 990000000000, 10800000000000, 117000000000000, 1260000000000000, 13500000000000000, 144000000000000000, 530000000000000000, 16200000000000000000
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
The Math Forum, Ask Dr. Math.
|
|
FORMULA
|
For n>1, a(n)=9n*10^(n-1)
|
|
EXAMPLE
|
a(1)=10 because there are ten one-digit numbers (including the 0);
a(2)=180 because there are 100-10=90 two-digits numbers, for a total of 90*2=180 digits.
|
|
CROSSREFS
|
Adjacent sequences: A113116 A113117 A113118 this_sequence A113120 A113121 A113122
Sequence in context: A053537 A049380 A057122 this_sequence A067416 A113671 A001762
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Jan 03 2006
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 08 2006
|
|
|
Search completed in 0.002 seconds
|
