|
Search: id:A051885
|
|
|
| A051885 |
|
Smallest number whose sum of digits is n. |
|
+0
13
|
|
| 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 199, 299, 399, 499, 599, 699, 799, 899, 999, 1999, 2999, 3999, 4999, 5999, 6999, 7999, 8999, 9999, 19999, 29999, 39999, 49999, 59999, 69999, 79999, 89999, 99999, 199999, 299999, 399999, 499999
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
n such that A061486(n) = n. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 06 2001
The product of digits incremented by 1 is the same as the number incremented by 1. If a(n) = abcd...( a,b,c,d etc. are digits of a(n)) {a(n) +1} = (a+1)*(b+1)(c+1)*(d+1)*... e.g. 299 +1 = (2+1)*(9+1)*(9+1) = 300. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 29 2003
A138471(a(n)) = 0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 19 2008
|
|
REFERENCES
|
A. Murthy, Exploring some new ideas on Smarandache type sets, functions and sequences, Smarandache Notions Journal Vol. 11 N. 1-2-3 Spring 2000
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
FORMULA
|
a(n) = ((n mod 9)+1)*10^floor[n/9]-1 = a(n-1)+10^floor[(n-1)/9]. - Henry Bottomley (se16(AT)btinternet.com), Apr 24 2001
a(n) = A037124(n) - 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 03 2008
|
|
MAPLE
|
P:=proc(n) local i, w, x; for i from 0 by 1 to n do w:=trunc(i/9); x:=(i-9*w)*10^w; while w>0 do x:=x+9*10^(w-1); w:=w-1; od; print(x); od; end: P(100); - Paolo P. Lava (ppl(AT)spl.at), Mar 11 2008
|
|
CROSSREFS
|
Cf. A061104, A061105, A061486, A007953, A067043.
Sequence in context: A077557 A075517 A088473 this_sequence A048410 A102491 A111706
Adjacent sequences: A051882 A051883 A051884 this_sequence A051886 A051887 A051888
|
|
KEYWORD
|
nonn,easy,base,nice
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Dec 15 1999
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 16 1999
|
|
|
Search completed in 0.002 seconds
|
