Smallest positive number that requires n steps to be represented as a sum of palindromes using the greedy algorithm.
A109326
Smallest positive number that requires n steps to be represented as a sum of palindromes using the greedy algorithm.
Terms
- a(0) =1a(1) =10a(2) =21a(3) =1022a(4) =101023a(5) =1000101024
External references
- oeis: A109326