I'm suffering some disconnection here: compare JA below
The upper bound used for the downward search is truly enormous for n = 2^16.
with https://oeis.org/draft/A000793 comments
Grantham mentions that he computed a(n) for n <= 500000.
--- citing a 1995 reference given later. Yet 2^16 = 65536 < 500000 , and JG's hardware 20 years older! WFL On 11/13/16, Joerg Arndt <arndt@jjj.de> wrote:
* Allan Wechsler <acwacw@gmail.com> [Nov 13. 2016 08:33]:
[...]
(Of all the code snippets in the relevant page at A000793, all of them except one are clearly just enumerating partitions and comparing LCM's. But Charles Greathouse's PARI code is not doing anything like that, and I don't have a clue what it *is* doing.)
Charles' code seems to use what I just entered as a formula in A000793: For n>=2, A000793(n) = max_{k} A008475(k) <= n. Cf. https://oeis.org/draft/A000793
Is this correct?
The upper bound used for the downward search is truly enormous for n = 2^16.
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun