[seqfan] Smallest number as sum of n palindromes

[Claudio Meller]

​Hi, yesterday a friend talk to me about the paper "Every natural number is
the sum of 49 palindromes"
(https://arxiv.org/pdf/1508.04721.pdf)​.

Based on this paper I came up with the following sequence " A(n) : Smallest
number that can be expressed as sum of at least n different palindromes"

A(1) = 0 or 1
A(2) = 10 (9+1)
A(3) = 21 (11+9+1)

More terms?
Is it interesting?