|
Search: id:A061772
|
|
|
| A061772 |
|
Number of n-digit multiples of n. |
|
+0
5
|
|
| 10, 45, 300, 2250, 18000, 150000, 1285714, 11250000, 100000000, 900000000, 8181818181, 75000000000, 692307692307, 6428571428571, 60000000000000, 562500000000000, 5294117647058824
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n) = floor [{9*10^(n-1}/n] or floor [{9*10^(n-1)}/n] + 1.
|
|
EXAMPLE
|
a(3) = 300 as there are 300 3-digit numbers divisible by 3, 102 to 999.
|
|
CROSSREFS
|
Sequence in context: A037270 A027800 A005714 this_sequence A032165 A124174 A044112
Adjacent sequences: A061769 A061770 A061771 this_sequence A061773 A061774 A061775
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 23 2001
|
|
EXTENSIONS
|
More terms from Jason Earls (zevi_35711(AT)yahoo.com), May 26 2001
|
|
|
Search completed in 0.002 seconds
|
