[seqfan] Re: n^3 - (largest square < n^3)

David Wilson dwilson at gambitcomm.com
Mon Jan 5 20:37:07 CET 2009


I believe there is an algorithm for solving x^3 - y^2 = k, which should 
have a finite number of solutions for any k. That means that we should 
in principle be able to compute A008725.

Maximilian Hasler wrote:
> See
>
> A087285  	 	 Possible differences between a cube and the next smaller square.
> 	2, 4, 7, 11, 13, 15, 19, 20, 26, 28, 35, 39, 40, 45, 47, 48, 49, 53,
> 55, 56, 60, 63, 67, 74, 76, 79, 81, 83, 100, 104, 107, 109, 116, 127,
> 135, 139, 146, 147, 148, 150, 152, 155, 170, 174, 180, 184, 186, 191,
> 193, 200, 207, 212, 215, 216, 233, 235, 242, 244, 249 (list; graph;
> listen)
>
> Maximilian
>
>   




More information about the SeqFan mailing list