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 A029781 #12 Apr 03 2023 17:58:45 %S A029781 0,1,25,36,100,121,625,2500,3025,3600,4096,4356,5776,9801,10000,10201, %T A029781 12100,12321,12544,13225,13456,15625,50625,62500,75625,82944,104329, %U A029781 141376,164025,249001,250000,251001,252004,275625,302500 %N A029781 Squares such that digits of sqrt(n) appear in both n and n^(3/2). %F A029781 a(n) = A029780(n)^2. - _Sean A. Irvine_, Mar 04 2020 %o A029781 (Python) %o A029781 from itertools import count, islice %o A029781 from math import prod %o A029781 def A029781_gen(): # generator of terms %o A029781 return map(lambda x:x[1], filter(lambda x:set(str(x[0])) <= set(str(x[1])) & set(str(prod(x))),((n,n**2) for n in count(0)))) %o A029781 A029781_list = list(islice(A029781_gen(),20)) # _Chai Wah Wu_, Apr 03 2023 %K A029781 nonn,base %O A029781 1,3 %A A029781 _Patrick De Geest_