[seqfan] Re: Computationally hard sequence with four known terms

Felix Fröhlich felix.froe at gmail.com
Fri Jun 3 16:55:43 CEST 2016


Okay, I agree. I have added it to the requested sequences in OEIS Wiki for
now.

Regards
Felix

2016-06-03 16:33 GMT+02:00 Neil Sloane <njasloane at gmail.com>:

> I think we need at least one more term.  1,1,1,1  is not enough!
>
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
> On Fri, Jun 3, 2016 at 10:25 AM, Felix Fröhlich <felix.froe at gmail.com>
> wrote:
>
> > I wonder, would the following sequence be okay to submit:
> >
> > omega(2^(2^p-1)-1) for p = A000043(n).
> >
> > i.e., a(n) = A001221(A000225(A000668(n))).
> >
> > So far the sequence seems to have only four known terms, a(1)-a(4): 1, 1,
> > 1, 1
> >
> > Four terms seems okay, but they are not very distinct. The next Double
> > Mersenne number has two known factors according to
> > http://www.doublemersennes.org/factors.php and
> > http://www.mersenneforum.org/showpost.php?p=248215&postcount=41, but the
> > complete factorization is apparently unknown.
> >
> > Regards
> > Felix Fröhlich
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>


More information about the SeqFan mailing list