login
A364362
Consider all the ways to make sequences of distinct nonnegative integers using all the digits of n, such that no term has leading 0's or appears more than once in the sequence. a(n) is the minimum possible sum of any sequence of n.
0
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 3, 4, 5, 6, 7, 8, 9, 10, 2, 3, 22, 5, 6, 7, 8, 9, 10, 11, 3, 4, 5, 33, 7, 8, 9, 10, 11, 12, 4, 5, 6, 7, 44, 9, 10, 11, 12, 13, 5, 6, 7, 8, 9, 55, 11, 12, 13, 14, 6, 7, 8, 9, 10, 11, 66, 13, 14, 15, 7, 8, 9, 10, 11, 12, 13
OFFSET
0,3
COMMENTS
Leading 0's are not permitted on any of the terms of the sequences of n. None of the terms are allowed to repeat in a given sequence of n.
Note, this sequence is the same as A331472 until n >= 100.
EXAMPLE
For n = 101, the following sequences can be made:
1-term sequences: {101}, {110};
2-term sequences: {10, 1}, {11, 0}, {1, 10}, {0, 11}.
Their sums are 101, 110, 10+1=11, 11+0=11, 1+10=11, and 0+11=11, respectively; the minimum sum is 11, so a(101) = 11.
CROSSREFS
Sequence in context: A069652 A055483 A331472 * A059717 A004185 A068636
KEYWORD
nonn,base
AUTHOR
Thomas Richardson, Jul 20 2023
STATUS
approved