|
%I #11 Nov 24 2015 01:23:15
%S 16,25,36,49,529,64,729,81,961,100,1156,121,1369,144,1521,169,1764,
%T 1849,196,2025,2116,225,23104,24336,256,26244,27225,289,2916,3025,
%U 3136,324,3364,3481,35344,361,3721,3844,3969,400,41209,4225,4356,441,45369,4624,4761,484,49284,5041,5184,529,5329,5476
%N a(n) = smallest square which is a concatenation of n and m, where m is a decimal number.
%C m can be 0 but not 00, so a(9) = 961, in contrast to A030666(9) = 900.
%H N. J. A. Sloane, <a href="/A264604/b264604.txt">Table of n, a(n) for n = 1..10000</a>
%p # Computes 10000 terms
%p for b from 1 to 10000 do
%p sw1:=-1;
%p for n from 0 to 1000000 do
%p len:=length(n);
%p if len=0 then len:=1; fi;
%p t2:=10^len*b+n;
%p if issqr(t2) then sw1:=1; lprint(b,t2); break; fi; od:
%p if sw1 < 0 then lprint("failed at",b); lprint(b,-1); fi;
%p od:
%Y Similar to A030666 but with a more stringent rule.
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_, Nov 24 2015
|
