[seqfan] Re: A018805 optimizations

[Charles Greathouse]

Great -- are you updating A018805 accordingly?

Charles Greathouse
Case Western Reserve University

On Thu, Jan 19, 2017 at 8:36 AM, David Wilson <davidwwilson at comcast.net>
wrote:

> For a while I've had an idea for optimizations for A018805(n) = { 1 <= x <=
> n, 1 <= y <= n, gcd(x, y) = 1 }.
> Now that I have a native C++ big integer package, I was able to implement
> my
> ideas.
> I was able to compute a(n) for powers of 10 up to 10^12 in a few minutes.
> I
> got
>
> 1e0 1
> 1e1 63
> 1e2 6087
> 1e3 608383
> 1e4 60794971
> 1e5 6079301507
> 1e6 607927104783
> 1e7 60792712854483
> 1e8 6079271032731815
> 1e9 607927102346016827
> 1e10 60792710185772432731
> 1e11 6079271018566772422279
> 1e12 607927101854119608051819
>
>
>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>