|
| |
|
|
A072290
|
|
a(n) = n*{10^(n-1) + 1} - A002275(n).
|
|
3
| |
|
|
1, 11, 192, 2893, 38894, 488895, 5888896, 68888897, 788888898, 8888888899, 98888888900, 1088888888901, 11888888888902, 128888888888903, 1388888888888904, 14888888888888905, 158888888888888906
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| In writing out all numbers 1 through 10^n inclusive, exactly a(n+1) digits are used, of which a(n) are 0's and there are n*10^(n-1) of each of the other digits, with still an extra one for 1's.
|
|
|
REFERENCES
| J. D. E. Konhauser et al., Which Way Did The Bicycle Go? Problem 134:"Digit Counting" pp. 40; 173-4 Dolciani Math. Exp. No. 18 MAA Washington DC 1996.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 1..200
|
|
|
FORMULA
| a(n+1) = a(n) + 9*n*10^(n-1) + 1.
a(n) = n + A053541(n) - A002275(n) = n + A033713(n). - Lekraj Beedassy (blekraj(AT)yahoo.com), Sep 16 2006
|
|
|
PROG
| (PARI) for(n=1, 23, print1(10^(n-1)*n+n-10^n/9+1/9" "))
(MAGMA) [(10^(n-1)*n+n-10^n/9+1/9): n in [1..30]]; // Vincenzo Librandi, Jun 06 2011
|
|
|
CROSSREFS
| Cf. A078427.
Sequence in context: A171553 A068649 A158509 * A112127 A142996 A201185
Adjacent sequences: A072287 A072288 A072289 * A072291 A072292 A072293
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 11 2002
|
|
|
EXTENSIONS
| More terms from Jason Earls (zevi_35711(AT)yahoo.com), Dec 18 2002
|
| |
|
|
