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

1, 1, 2, 3, 3, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 4, 3, 4, 4, 4, 6, 6, 5, 6, 3, 7, 4, 7, 5, 5, 7, 7, 7, 6, 6, 9, 7, 8, 6, 8, 9, 8, 9, 7, 11, 10, 9, 10, 9, 11, 8, 12, 11, 10, 10, 12, 12, 12, 10, 15, 12, 15, 10, 15, 14, 15, 14, 14, 18, 16, 13, 15, 14, 16, 11, 13, 17

0

Three terms seem to be enough.

T. D. Noe, Plot of 10000 terms

T. D. Noe, Table of 10000 terms

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

(Mma) base = 4; 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