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, 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
Examples
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.
Links
- Thomas Richardson, Table of n, a(n) for n = 0..10000
Comments