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 A239210 #16 Jul 17 2021 02:50:25 %S A239210 7,17,23,26,47,53,67,73,76,77,83,86,94,97,143,157,163,167,173,176,187, %T A239210 193,194,197,223,233,236,244,253,256,257,260,274,277,283,287,293,307, %U A239210 313,314,457,473,493,503,517,523,527,533,547,553,577,583,587,607,613 %N A239210 Numbers k such that k^2 is not divisible by any of its nonzero digits. %H A239210 Colin Barker, <a href="/A239210/b239210.txt">Table of n, a(n) for n = 1..1000</a> %e A239210 53 is a term because 53^2 = 2809 is not divisible by 2, 8 or 9. %t A239210 ndnzQ[n_]:=Count[n^2/Select[IntegerDigits[n^2],#!=0&],_?IntegerQ]==0; Select[Range[750],ndnzQ] (* _Harvey P. Dale_, Jun 02 2015 *) %o A239210 (PARI) isOK(n) = my(v=vecsort(digits(n^2), , 8)); for(i=1+(v[1]==0), #v, if(n^2%v[i]==0, return(0))); 1 %o A239210 s=[]; for(n=1, 1000, if(isOK(n), s=concat(s, n))); s %o A239210 (Python) %o A239210 def ok(n): return not any(n*n%int(d) == 0 for d in str(n*n) if d != '0') %o A239210 print(list(filter(ok, range(1, 614)))) # _Michael S. Branicky_, Jul 17 2021 %Y A239210 Cf. A239211, A239212, A239213. %K A239210 nonn,base %O A239210 1,1 %A A239210 _Colin Barker_, Mar 12 2014