OFFSET
1,2
COMMENTS
Incrementing each digit means b^2-a^2 = R_n, the n-digit repunit (10^n-1)/9; so solutions must be of the form a = (u-v)/2, b = (u+v)/2, where u * v = R_n. It remains to check that this is in the right range and a has no 9's. - Franklin T. Adams-Watters, May 25 2006
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..78 (contains all terms below 10^262)
EXAMPLE
13225 = 115^2 and 24336 = 156^2.
PROG
(PARI) hasdigit(n, d, b=10) = local(r); r=0; while(r==0&&n>=1, if(n%b==d, r=1, n\=b)); r /* Generates all positive n-digit solutions (in reverse order) */ A061843s(n) = local(f, nf, v, i, ru, lb, ub, x); lb=10^(n-1); ub=10^n-1; ru=ub\9; f=divisors(ru); v=[]; nf=matsize(f)[2]; for(i=1, nf\2, x=( (f[nf+1-i]-f[i])\2)^2; if(x>=lb&&x<=ub&&!hasdigit(x, 9), v=concat(v, [x]))); v \\ Franklin T. Adams-Watters, May 25 2006
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Erich Friedman, Jun 23 2001
EXTENSIONS
More terms from Franklin T. Adams-Watters, May 25 2006
STATUS
approved