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 A184988 #13 Nov 05 2020 15:39:45
%S A184988 0,1,4,9,6,5,6,9,6,8,1,121,44,9,9,22,6,9,4,6,4,44,484,9,7,6,676,9,8,8,
%T A184988 9,9,4,9,11,22,9,9,444,5,6,8,7,9,9,202,11,22,4,4,5,6,7,9,9,5,313,9,33,
%U A184988 8,6,7,44,969,9,22,6,44,6,7,9,5,8,9,7,6,77,929
%N A184988 Largest palindromic substring of n^2.
%C A184988 Leading 0's are not allowed, so a(103) = 9, not 060. - _Robert Israel_, Nov 05 2020
%H A184988 Robert Israel, <a href="/A184988/b184988.txt">Table of n, a(n) for n = 0..10000</a>
%F A184988 a(n) = A047813(A000290(n)).
%e A184988 a(15) = largest palindromic substring of 15^2 = largest palindromic substring of 225 = 22.
%p A184988 g:= proc(S) S[1] <> "0" and S = StringTools:-Reverse(S) end proc:
%p A184988 f:= proc(n) local S,d,l,i,Q;
%p A184988 S:= sprintf("%d",n^2);
%p A184988 d:= length(S);
%p A184988 for l from d to 1 by -1 do
%p A184988 Q:= select(g, [seq(S[i..i+l-1],i=1..d+1-l)]);
%p A184988 if Q <> [] then return op(sscanf(max(Q),"%d")) fi
%p A184988 od;
%p A184988 end proc:
%p A184988 f(0):= 0:
%p A184988 map(f, [$0..200]); # _Robert Israel_, Nov 05 2020
%Y A184988 Cf. A000290, A002113, A047813.
%K A184988 nonn,base,easy,look
%O A184988 0,3
%A A184988 _Jonathan Vos Post_, Mar 27 2011