[seqfan] Re: Classic sequence A000229 needs a b-file

[Robert Gerbicz]

http://cr.yp.to/focus.html is discussing a similar problem (that sequence
is also in oeis). His doubly focused enumeration improves the general
sieving methods on these problems.


2013/9/3 Charles Greathouse <charles.greathouse at case.edu>

> It looks hard to me. a(n) should be within a few orders of magnitude of
> n*2^n and unless you can exclude almost all of the candidates quickly
> larger values seem out of reach. If Tomás was only able to find 38 terms I
> doubt many more are within mortal reach at present technology.
>
> Charles Greathouse
> Analyst/Programmer
> Case Western Reserve University
>
>
> On Tue, Sep 3, 2013 at 1:17 PM, Neil Sloane <njasloane at gmail.com> wrote:
>
> > A000229a(n) is the least number such that the n-th prime is the least
> > quadratic nonresidue for a(n) (a(n) is always a prime).  (Formerly M2684
> > N1074)
> >
> > This sequence was recently mentioned in
> > a physics paper. Maybe it is hard to compute, but
> > if not it could use a b-file!
> >
> > Neil
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>