A056796 Minimal number of steps to get from 0 to n when there are 3 kinds of step: add 1, multiply by 2, multiply by 3.
0, 1, 2, 2, 3, 4, 3, 4, 4, 3, 4, 5, 4, 5, 5, 5, 5, 6, 4, 5, 5, 5, 6, 7, 5, 6, 6, 4, 5, 6, 5, 6, 6, 6, 7, 8, 5, 6, 6, 6, 6, 7, 6, 7, 7, 6, 7, 8, 6, 7, 7, 7, 7, 8, 5, 6, 6, 6, 7, 8, 6, 7, 7, 6, 7, 8, 7, 8, 8, 8, 9, 10, 6, 7, 7, 7, 7, 8, 7, 8, 7, 5, 6, 7, 6, 7, 8, 7, 8, 9, 6, 7, 8, 7, 8, 9, 7, 8, 8
Offset: 0
Keywords
References
- Proposed by Mark Sapir, Math. Dept., Vanderbilt University, August 2000.