The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057535 Numbers expressible as (a^2 - 1)(b^2 - 1) in 5 distinct ways. 6
588107520, 67270694400, 546939993600, 2128050512640, 37400697734400, 5566067918611200 (list; graph; refs; listen; history; text; internal format)



The next term (if it exists) is greater than 2^70.


Table of n, a(n) for n=1..6.

K. S. Brown, Numbers Expressible as (a^2-1)(b^2-1)

K. S. Brown, MathPages Most Wanted List, Problem #14.


(PARI) { f(a, b) = (a+1)*(a-1)*(b+1)*(b-1) } ans=vector(6, x, [0, 0]); clear=ans; { g(a) = b=divisors(a*a-1); l=length(b); b=b+vector(l, x, a); for(x=1, l/2, c=4*a*b[x]*(a+1)*(a-1)*(b[x]+1)*(b[x]-1)*(a*b[x]-1)/((b[x]-a)*(b[x]-a));

d=floor(sqrt(sqrt(c))); count=1; for( y=2, d, if (c%(y*y-1)==0, e=ceil(sqrt(c/(y*y-1))); if (f(y, e)==c, ans[count]=[y, e]; count=count+1, ), ); ); if ( count>5, print("g:", a, " ", c, " ", ans); ans=clear, ); ); } { find()= for(n=560, 10001, print(n); g(n)); }

Store program as text file, load gp, \r textfilename and then run function find() to search for a 7th entry.

(PARI) { f(a, b) = (a+1)*(a-1)*(b+1)*(b-1) } ans=vector(6, x, [0, 0])


Cf. A063066, A063067, A063068.

Cf. A134856, A134857, A134858 (identical?).

Sequence in context: A032755 A234391 A297448 * A134858 A145277 A253166

Adjacent sequences:  A057532 A057533 A057534 * A057536 A057537 A057538




K. S. Brown (ksbrown(AT)seanet.com), Fred W. Helenius (fredh(AT)ix.netcom.com), Dean Hickerson, Randall L. Rathbun



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 15:36 EST 2020. Contains 338928 sequences. (Running on oeis4.)