2^n = 3 (mod n) : New solution: 10991007971508067

[Max A.]

On 1/22/07, Rainer Rosenthal <r.rosenthal at web.de> wrote:

> could you please update not only
> http://www.research.att.com/~njas/sequences/A050259
>
> but also
> http://www.research.att.com/~njas/sequences/A015910

I have sent an update to these sequences to Neil.

P.S. I am (still) finishing my exploration of all solutions below
10^16. That will bring at least a pair of two new terms to A050259. I
also plan to extend my exploration to 1.1*10^16 later to cover the
latest solution found by Joe.

Max