Number of palindromic (in base 8) triples that sum to n.

1, 1, 2, 3, 4, 5, 7, 8, 9, 11, 11, 12, 12, 12, 11, 11, 9, 8, 8, 7, 6, 6, 5, 5, 5, 5, 4, 6, 5, 5, 5, 5, 5, 5, 5, 4, 7, 6, 6, 6, 6, 6, 6, 6, 4, 8, 6, 6, 6, 6, 6, 6, 6, 4, 10, 7, 7, 7, 7, 7, 7, 7, 4, 11, 7, 8, 8, 9, 9, 10, 10, 8, 16, 12, 11, 12, 10, 11, 9, 10, 5, 16

0

Three terms seem to be enough.

T. D. Noe, Plot of 10000 terms

T. D. Noe, Table of 10000 terms

Javier Cilleruelo and Florian Luca, Every positive integer is a sum of three palindromes, arXiv 1602.06208 (Feb 19 2016)

Yu Gao, Represent a natural number as the sum of palindromes in various bases, arXiv 1508.06185 (Aug 24 2015)

(Mma) base = 8; mx = 100; pal = Select[Range[0, mx], (d = IntegerDigits[#, base]; d == Reverse[d]) &]; Table[Length[IntegerPartitions[n, {3}, pal]], {n, 0, mx}]

nonn,base

T. D. Noe, Sep 23 2015