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 A052040 #32 Sep 08 2022 08:44:59 %S A052040 1,2,3,4,5,6,7,8,9,11,12,13,14,15,16,17,18,19,21,22,23,24,25,26,27,28, %T A052040 29,31,34,35,36,37,38,39,41,42,43,44,46,54,56,57,58,59,61,62,63,65,66, %U A052040 67,68,69,72,73,74,75,76,77,79,81,82,83,85,86,87,88,89,91,92,93,94,96 %N A052040 Numbers whose square is zeroless. %C A052040 This sequence is infinite, since 33...334^2 = 11...11155...556, for example. This answers an open problem stated in HAKMEM. - _Karl W. Heuer_, Aug 19 2015 %H A052040 Charles R Greathouse IV, <a href="/A052040/b052040.txt">Table of n, a(n) for n = 1..10000</a> %H A052040 Michael Beeler, R. William Gosper, and Rich Schroeppel, <a href="http://www.inwap.com/pdp10/hbaker/hakmem/number.html#item36">"HAKMEM" Item 36</a>, Memo 239, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Mass., 1972. %e A052040 From _Jon E. Schoenfield_, Aug 16 2021: (Start) %e A052040 31 is a term: 31^2 = 961 has no 0's among its digits. %e A052040 32 is not a term, because 32^2 = 1024. (End) %t A052040 Select[Range[0, 100], DigitCount[#^2, 10, 0]==0 &] (* _Vincenzo Librandi_, Feb 22 2015 *) %o A052040 (PARI) is(n)=vecmin(digits(n^2))>0 \\ _Charles R Greathouse IV_, Oct 11 2013 %o A052040 (Magma) [n: n in [1..100] | not 0 in Intseq(n^2)]; // _Vincenzo Librandi_, Feb 22 2015 %Y A052040 Squares: A052041, A052042, A052043. Cubes: A051750, A051751, A051832, A051833. %Y A052040 Cf. A052382. %K A052040 nonn,base %O A052040 1,2 %A A052040 _Patrick De Geest_, Dec 15 1999