[seqfan] Re: Cases n>9?

[Allan Wechsler]

So we are looking for a number n such that n, n+1, and 2n + 1 all have
exactly 10 prime factors, counted with multiplicity. This is obviously
quite hard; I don't see any obvious tricks that avoid brute-force search.
Anybody want to spend a bunch of CPU on this? Or are there some shortcuts
that I am missing?

On Sun, Mar 26, 2023 at 10:10 PM zak seidov via SeqFan <
seqfan at list.seqfan.eu> wrote:

> Can anyone solve cases n>9? I spend 2-3 days to no avail:(    {for (m = 1,
> 10, n = 2;    while (m != bigomega (n) || m != bigomega (n + 1) ||    m !=
> bigomega (2*n + 1), n++); print (m ", " n ", "))}1, 2,2, 25,3, 171,4,
> 1592,5, 37975,6, 928624,7, 8412687,8, 106390624,9, 2306890624,
> Thx,Zak
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>