This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A331472 #18 Jan 15 2025 22:46:22
%S A331472 0,1,2,3,4,5,6,7,8,9,1,11,3,4,5,6,7,8,9,10,2,3,22,5,6,7,8,9,10,11,3,4,
%T A331472 5,33,7,8,9,10,11,12,4,5,6,7,44,9,10,11,12,13,5,6,7,8,9,55,11,12,13,
%U A331472 14,6,7,8,9,10,11,66,13,14,15,7,8,9,10,11,12,13
%N A331472 Consider the different ways to split the decimal representation of n into palindromic parts; a(n) is the greatest possible sum of the parts of such a split.
%C A331472 Leading zeros are forbidden in the decimal representation of n; however we allow leading zeros in the palindromic parts.
%H A331472 Rémy Sigrist, <a href="/A331472/b331472.txt">Table of n, a(n) for n = 0..10000</a>
%H A331472 Rémy Sigrist, <a href="/A331472/a331472.gp.txt">PARI program for A331472</a>
%F A331472 a(n) <= n with equality iff n belongs to A002113.
%e A331472 For n = 1664:
%e A331472 - we can split this number into "1" and "6" and "6" and "4",
%e A331472 - or into "1" and "66" and "4",
%e A331472 - hence a(1664) = max(17, 71) = 71.
%t A331472 palQ[w_] := w == Reverse@w; ric[tg_, cr_] := Block[{m = Length@tg, t}, If[m == 0, Sow@ Total[ FromDigits /@ cr], Do[ If[ palQ[t = Take[tg, k]], ric[Drop[tg, k], Join[ cr, {t}]]], {k, m}]]]; a[n_] := Max[ Reap[ ric[ IntegerDigits[n], {}]][[2, 1]]]; a /@ Range[0, 99] (* _Giovanni Resta_, Jan 19 2020 *)
%o A331472 (PARI) \\ See Links section.
%Y A331472 Cf. A002113, A331471 (binary analog).
%K A331472 nonn,base
%O A331472 0,3
%A A331472 _Rémy Sigrist_, Jan 17 2020