[seqfan] Re: Cases n>9?

[israel at math.ubc.ca]

The question was about x, x+1 and 2*x+1, not x, x+1 and x+2.

Cheers,
Robert

On Mar 27 2023, Emmanuel Vantieghem wrote:

>Op ma 27 mrt 2023 om 07:12 schreef <israel at math.ubc.ca>:
>
>> Finding the least such n may indeed be hard, but it's not that hard
>> to find one such n: e.g. 144812890624.
>> ...
>>
>________________
>
>I think this is wrong : 144812890626 = 2*3*83*563*516499.
>This is a good one : 63608890624 = (2^8)*10847*22907
>                                63608890625 = (5^6)*(7^2)*251*331
>                                63608890626 = 2*(3^7)*223*65213
>
>Sincere greetings.
>
>--
>Seqfan Mailing list - http://list.seqfan.eu/
>
>