login
A229792
Numbers n with the property that there exists an m such that n is the sum of m distinct nonzero digits (with 1<m<10) in a unique way.
0
3, 4, 6, 7, 10, 11, 15, 16, 17, 21, 22, 23, 24, 28, 29, 30, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45
OFFSET
1,1
COMMENTS
Uniqueness means that if n is the sum of m distinct digits then there does not exist any other set of m distinct digits whose sum is n. This sequence may be useful for puzzle-digit games, often of oriental origin, like Kakuro, Kendoku, Sudoku-variants, etc.
EXAMPLE
16 belongs to this sequence because there exists only one set of two distinct digits whose sum is 16: {7, 9}. (Also, there exists only one set of five distinct digits whose sum is 16: {1, 2, 3, 4, 6}.) 6 belongs to this sequence because there exists only one set of three distinct digits whose sum is 6: {1, 2, 3}.
CROSSREFS
Sequence in context: A183233 A191926 A065135 * A101299 A143837 A354005
KEYWORD
nonn,fini,full,base
AUTHOR
Pierandrea Formusa, Sep 29 2013
EXTENSIONS
Comments and Examples edited by Jon E. Schoenfield, Sep 29 2013
STATUS
approved