|
%I #17 Jun 19 2021 13:14:35
%S 6241,20164,92416,124609,128164,132496,162409,165649,186624,195364,
%T 196249,209764,214369,244036,258064,264196,268324,326041,346921,
%U 351649,362404,395641,401956,436921,495616,541696,543169,605284,628849,643204,648025,651249,652864,669124,687241,822649,824464,868624,1034289,1036324,1046529,1054729,1065024,1073296,1132096
%N Squares k such that, if k has d digits, k has at least one digit in common with every other d-digit square.
%C Inspired by a problem of Bernardo Recamán Santos found in http://www.mathpuzzle.com/
%C How were these computed? Is there a better way than by brute force? - _N. J. A. Sloane_, Nov 27 2010
%H Claudio Meller, <a href="/A173943/b173943.txt">Table of n, a(n) for n = 1..233</a>
%K nonn,base
%O 1,1
%A _Claudio Meller_, Nov 26 2010
|
