OFFSET
1,1
COMMENTS
Conjecture: a(n) exists for all numbers n.
a(1) = A030467(1).
The same problem with the concatenation of x + n instead of x + n^2 is difficult.
The corresponding sequence with x + n instead of x + n^2 starts with 36363636364, 428, 8874, 5, 310, 7, 39 for n = 0,...,6, and a(7) > 10^70, if it exists. - Giovanni Resta, Jun 24 2019
LINKS
Michel Lagneau, Table of n, a(n) for n = 1..245
EXAMPLE
a(11) = 704 because 704^2 = 495616 is the concatenation of 495 and 616, and 616 - 495 = 121 = 11^2.
MAPLE
for n from 1 to 47 do:
ii:=0:
for k from 1 to 10^7 while(ii=0)do :
x:=convert(k^2, base, 10):n1:=nops(x):
if irem(n1, 2)=0
then
s:=sum('x[i]*10^(i-1) ', 'i'=1..n1/2):
z:=convert(s, base, 10):
s1:=sum('x[j]*10^(j-n1/2-1) ', 'j'=n1/2+1..n1):
if s-s1 = n^2
then
ii:=1:printf(`%d, `, k):
else
fi:
fi:
od:
od:
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Michel Lagneau, Jan 24 2014
EXTENSIONS
Definition corrected by Giovanni Resta, Jun 24 2019
STATUS
approved