A264604 a(n) = smallest square which is a concatenation of n and m, where m is a decimal number.
16, 25, 36, 49, 529, 64, 729, 81, 961, 100, 1156, 121, 1369, 144, 1521, 169, 1764, 1849, 196, 2025, 2116, 225, 23104, 24336, 256, 26244, 27225, 289, 2916, 3025, 3136, 324, 3364, 3481, 35344, 361, 3721, 3844, 3969, 400, 41209, 4225, 4356, 441, 45369, 4624, 4761, 484, 49284, 5041, 5184, 529, 5329, 5476
Offset: 1
Links
- N. J. A. Sloane, Table of n, a(n) for n = 1..10000
Crossrefs
Similar to A030666 but with a more stringent rule.
Programs
-
Maple
# Computes 10000 terms for b from 1 to 10000 do sw1:=-1; for n from 0 to 1000000 do len:=length(n); if len=0 then len:=1; fi; t2:=10^len*b+n; if issqr(t2) then sw1:=1; lprint(b,t2); break; fi; od: if sw1 < 0 then lprint("failed at",b); lprint(b,-1); fi; od:
Comments