[seqfan] Re: Fwd: Your A051217 Nonnegative numbers of the form 6^x-y^2.

David Wilson davidwwilson at comcast.net
Fri Nov 18 02:55:36 CET 2011

I wrote a rather brute-force program for either solving 6^x - y^2 or 
finding a modulus
in which 6^x - y^2 is insoluble. However, my program would be too slow 
to check anywhere
near 10^11.

Does your program agree with the A051217 b-file?

Can it be adapted to verify (and provide b-files for) A051204 through 

On 11/17/2011 2:28 AM, Charles Greathouse wrote:
> David Wilson verified the sequence through 1152 and I did similarly
> through 10^11.  I can't prove that it's computable in general (thanks
> for correcting my terminology here, David) but I strongly suspect it
> is.
> Charles Greathouse
> Analyst/Programmer
> Case Western Reserve University
> On Wed, Nov 16, 2011 at 5:11 PM, Vladimir Shevelev<shevelev at bgu.ac.il>  wrote:

More information about the SeqFan mailing list