|
|
EXAMPLE
|
a(1) = 10 as 10 = 2 * 5, and {10, 2, 5} contains the numbers 0 and 1 as non-overlapping substrings, and no smaller number has a similar factorization.
a(2) = 10 as {10, 2, 5} also contains the number 0, 1, and 2.
a(3) = 30 as 30 = 2 * 15, and {30, 2, 15} contains 0,..,3.
a(4) = 102 as 102 = 3 * 34, which contains 0,..,4.
a(5) = 120 as 120 = 2 * 3 * 4 * 5, which contains 0,..,5.
a(6) = 240 as 240 = 3 * 5 * 16, which contains 0,..,6. The first perfect solution.
a(7) = 1260 as 1260 = 3 * 3 * 4 * 5 * 7, which contains 0,..,7.
a(8) = 1680 as 1680 = 2 * 2 * 3 * 4 * 5 * 7, which contains 0,..,8.
a(9) = 8596 as 8596 = 2 * 14 * 307, which contains 0,..,9. A perfect solution.
a(10) = 34580 = 7 * 10 * 19 * 26, which contains 0,..,10. A perfect solution. Note that all three of 0, 1, and 10 must appear as separate nonoverlapping substrings.
a(11) = 113760 as 113760 = 2 * 4 * 9 * 10 * 158, which contains 0,..,11. A perfect solution.
a(12) = 576840 as 576840 = 10 * 11 * 12 * 19 * 23, which contains 0,..,12. A perfect solution.
a(13) = 3579840 as 3579840 = 2 * 2 * 6 * 10 * 11 * 12 * 113, which contains 0,..,13.
a(14) = 14938560 as 14938560 = 7 * 10 * 12 * 12 * 13 * 114, which contains 0,...,14. A perfect solution.
a(15) = 109133640 as 109133640 = 2 * 11 * 14 * 18 * 127 * 155, which contains 0,...,15.
|
