|
Search: id:A069800
|
|
|
| A069800 |
|
Triangular array in which n-th row consists of numbers with digit sum n arranged in increasing numerical order. |
|
+0
2
|
|
| 1, 2, 11, 3, 12, 21, 111, 4, 13, 22, 31, 112, 121, 211, 1111, 5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111, 11111, 6, 15, 24, 33, 42, 51, 114, 123, 132, 141
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
0 is not allowed as a digit.
There are exactly 2^n numbers with a digit sum of n if no digit is zero.
|
|
EXAMPLE
|
1; 2,11; 3,12,21,111; 4,13,22,31,112,121,211,1111; ...
|
|
CROSSREFS
|
Cf. A069801.
Adjacent sequences: A069797 A069798 A069799 this_sequence A069801 A069802 A069803
Sequence in context: A121713 A134242 A081926 this_sequence A060002 A110741 A113625
|
|
KEYWORD
|
nonn,tabf,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 13 2002
|
|
|
Search completed in 0.002 seconds
|
