Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Oct 17 2019 22:16:27
%S 169,10816,1028196,102475129,10210496209,1021021327936,
%T 102102415721476,10210210652174569,1021021026820134201,
%U 102102102318249314064,10210210230410293217569
%N Palfree squares whose root is the smallest possible greater than 10^n (palfree = contains no palindromic substring except single digits).
%C Probably finite.
%H Keith Schneider, <a href="/A052066/b052066.txt">Table of n, a(n) for n = 1..25</a>
%H Keith Schneider, <a href="/A052065/a052065.txt">Mathematica code for A052025-A052028</a>
%Y Cf. A052065, A052061, A052062.
%K nonn,base
%O 1,1
%A _Patrick De Geest_, Jan 15 2000
%E More terms from Keith Schneider (schneidk(AT)email.unc.edu), May 23 2007