[seqfan] Re: Primorial Polynomial ?

[Hugo Pfoertner]

Try Kim Walisch's "primecount" program to compute Prime[large number]

https://github.com/kimwalisch/primecount

primecount -t4 -n 12055296811267

produces 392654585611999 in less than 2 seconds on 4 cores of a Core
i5-2400 @ 3.1 GHz.


On Mon, Aug 20, 2018 at 6:26 PM, Chai Wah Wu <cwwuieee at gmail.com> wrote:

> Some more terms:
> a(0) = 2
> a(12) = 31
> a(13) = 7
> a(14) = 17
>
> On Sunday, August 19, 2018, Hans Havermann <gladhobo at bell.net> wrote:
>
> > Mathematica does a little better than WEC's Maple, calculating eleven
> > terms (5, 3, 13, 5, 3, 29, 3, 13, 13, 3, 5) before encountering the
> > inevitable limitation of Prime[n] for the twelfth term (at prime 17):
> >
> > NestList[Prime,17,12]
> > {17,59,277,1787,15299,167449,2269733,37139213,718064159,
> > 16123689073,414507281407,12055296811267,Prime[12055296811267]}
> >
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>