Computation of the values for n <= 10^6 took 15 hours. The resulting file is 1,061.3 MiB, and 182.7 MiB after compression using xz -9 Should I put it online? Or even better: does anybody have/know a web server where this file could be offered? Best regards, jj * Joerg Arndt <arndt@jjj.de> [Nov 14. 2016 12:16]:
Here is a Pari/GP version (omitting a(0)): -------------------------- { \\ compute all terms for n = 1 .. N my( N = 2^16 ); my( V = vector(N,j,1) ); forprime (i=2, N, \\ primes i forstep (j=N, i, -1, my( hi = V[j] ); my( pp = i ); \\ powers of prime i while( pp<=j, \\ V[] is 1-based if ( j-pp == 0, hi = max(hi, 1 * pp) ; , /* else */ hi = max(hi, V[j-pp]*pp) ); pp *= i; ); V[j] = hi; ); ); \\ print( V ); \\ to print all print( V[#V] ); \\ to print just a(N) } \\ translated from code given by Tomas Rokicki, _Joerg Arndt_, Nov 14 2016 --------------------------
[...]