The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 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, 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, 14, 6, 7, 8, 9, 10, 11, 66, 13, 14, 15, 7, 8, 9, 10, 11, 12, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Leading zeros are forbidden in the decimal representation of n; however we allow leading zeros in the palindromic parts. LINKS Rémy Sigrist, Table of n, a(n) for n = 0..10000 Rémy Sigrist, PARI program for A331472 FORMULA a(n) <= n with equality iff n belongs to A002113. EXAMPLE For n = 1664: - we can split this number into "1" and "6" and "6" and "4", - or into "1" and "66" and "4", - hence a(1664) = max(16, 71) = 71. MATHEMATICA 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 *) PROG (PARI) See Links section. CROSSREFS Cf. A002113, A331471 (binary analog). Sequence in context: A084051 A069652 A055483 * A059717 A004185 A068636 Adjacent sequences:  A331469 A331470 A331471 * A331473 A331474 A331475 KEYWORD nonn,base AUTHOR Rémy Sigrist, Jan 17 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 15 02:21 EDT 2021. Contains 343909 sequences. (Running on oeis4.)