13 Nov
2016
13 Nov
'16
1:23 a.m.
* 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