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 #21 Jan 13 2020 02:32:41
%S 0,1,100,10000,1000000,22676644,23348224,100000000,107661376,
%T 110103049,125552025,153388225,160022500,219899241,504002500,
%U 552532036,605406025,696643236,1169366416,1311526225,2267664400
%N Squares n such that sqrt(n) and n have the same set of digits.
%C Only perfect squares are considered. Otherwise, this sequence would have to include numbers like 1234567890, since sqrt(1234567890) = 35136.41828644462161665823116758077037159... - _Alonso del Arte_, Jan 12 2020
%H Shawn A. Broyles and David A. Corneth, <a href="/A029794/b029794.txt">Table of n, a(n) for n = 1..10000</a> (First 1001 terms by Shawn A. Broyles)
%F a(n) = A029793(n)^2. - _Michel Marcus_, Apr 29 2018
%t Select[Range[0, 199999], Union[IntegerDigits[#]] == Union[IntegerDigits[#^2]] &]^2 (* _Alonso del Arte_, Jan 12 2020 *)
%o (PARI) lista(nn) = {for (n=0, nn, if (Set(digits(n^2)) == Set(digits(n)), print1(n^2, ", ")););} \\ _Michel Marcus_, Apr 29 2018
%Y Cf. A029793.
%K nonn,base
%O 1,3
%A _Patrick De Geest_
%E Offset corrected by _Michel Marcus_, Apr 29 2018