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 A052062 #21 Aug 11 2024 22:06:45
%S A052062 0,1,4,9,16,25,36,49,64,81,169,196,256,289,324,361,529,576,625,729,
%T A052062 784,841,961,1024,1089,1296,1369,1521,1681,1764,1849,1936,2304,2401,
%U A052062 2601,2704,2809,2916,3025,3249,3481,3721,4096,4356,4624,4761,5041,5184,5329
%N A052062 Squares containing no palindromic substring except single digits.
%C A052062 Leading zeros in substring allowed so 103^2 = 10609 is rejected because 1{060}9 contains a palindromic substring.
%C A052062 A comment in A052061 suggests that this sequence is infinite.
%H A052062 Charles R Greathouse IV, <a href="/A052062/b052062.txt">Table of n, a(n) for n = 1..10001</a>
%F A052062 a(n) = A052061(n)^2. - _Andrew Howroyd_, Aug 11 2024
%e A052062 2304 (= 48^2) -> substrings 23, 30, 04, 230, 304 and 2304 are all non-palindromic.
%o A052062 (PARI) noPalSub(n)={my(d);local(digit);digit=eval(Vec(Str(n)));d = #digit;for(len=2,d,for(i=1,d-len+1,if(isPalSub(i,len), return(0))));1};isPalSub(start,len)={my(b=start-1,e=start+len);for(j=1,len>>1,if(digit[b+j] != digit[e-j], return(0)));1}
%o A052062 for(n=0,100,if(noPalSub(n^2),print1(n^2", ")))
%Y A052062 Cf. A052061, A052063, A052064, A050749.
%K A052062 nonn,base
%O A052062 1,3
%A A052062 _Patrick De Geest_, Jan 15 2000
%E A052062 Program and b-file from _Charles R Greathouse IV_, Sep 09 2009
%E A052062 Offset changed by _Andrew Howroyd_, Aug 11 2024