|
%I #25 Sep 18 2022 19:45:54
%S 0,1,2,3,4,5,6,7,8,9,1,11,2,3,4,5,6,7,8,9,2,2,22,3,4,5,6,7,8,9,3,3,3,
%T 33,4,5,6,7,8,9,4,4,4,4,44,5,6,7,8,9,5,5,5,5,5,55,6,7,8,9,6,6,6,6,6,6,
%U 66,7,8,9,7,7,7,7,7,7,7,77,8,9,8,8,8,8,8,8,8,8,88,9,9,9,9,9,9,9
%N Largest palindromic substring of n.
%C a(n) = A262188(n,A262190(n)-1). - _Reinhard Zumkeller_, Sep 14 2015
%H Reinhard Zumkeller, <a href="/A047813/b047813.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%e a(1313) = Max{1,3,131,313} = 313.
%t palQ[n_Integer, base_Integer] := Module[{idn = IntegerDigits[n, base]}, idn == Reverse[ idn]]; f[n_] := Block[{id = IntegerDigits@ n, mx = -Infinity}, k = Length@ id; While[k > 0 && mx == -Infinity, mx = Max[mx, Select[ FromDigits@# & /@ Partition[id, k, 1], palQ[#, 10] &]]; k--]; mx] (* _Robert G. Wilson v_, Aug 24 2011 *)
%t lps[n_]:=Module[{idn=IntegerDigits[n]},Max[FromDigits/@Select[ Flatten[ Table[ Partition[ idn,i,1],{i,Length[idn]}],1],#==Reverse[#]&]]]; Array[ lps,100,0] (* _Harvey P. Dale_, Jan 09 2015 *)
%o (Haskell)
%o a047813 = last . a262188_row
%o -- _Reinhard Zumkeller_, Sep 14 2015, Aug 23 2011
%o (Python)
%o def c(s): return (s[0] != "0" or s == "0") and s == s[::-1]
%o def a(n):
%o s = str(n)
%o ss = (s[i:j] for i in range(len(s)) for j in range(i+1, len(s)+1))
%o return max(int(w) for w in ss if c(w))
%o print([a(n) for n in range(96)]) # _Michael S. Branicky_, Sep 18 2022
%Y Cf. A136522.
%Y Cf. A262188, A262223, A262224.
%K nonn,easy,base,nice,look
%O 0,3
%A _N. J. A. Sloane_
|
