|
Search: id:A037124
|
|
|
| A037124 |
|
Numbers that contain only one nonzero digit. |
|
+0
9
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Starting with 1: next greater number not containing the highest digit (see also A098395). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 31 2004
a(n) = A140740(n+9,9). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 26 2008
|
|
FORMULA
|
a(n) = [(n mod 9)+1] * 10^floor(n/9). E.g. a(39) = [(39 mod 9)+1] * 10^floor(39/9) = [3+1] * 10^4 = 40000 - Carl R. White (cyrek(AT)cyreksoft.yorks.com), Jan 08 2004
a(n) = A051885(n) + 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 03 2008
A138707(a(n)) = A000005(a(n)); A061116 is a subsequence. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 26 2008
a(n+1) = a(n) + a(n - n mod 9). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 26 2008
|
|
CROSSREFS
|
Cf. A000079, A038754, A133464, A140730.
Sequence in context: A070958 A051596 A071061 this_sequence A068861 A068860 A061511
Adjacent sequences: A037121 A037122 A037123 this_sequence A037125 A037126 A037127
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vasiliy Danilov (danilovv(AT)usa.net) Jun 15 1998
|
|
|
Search completed in 0.002 seconds
|
