OFFSET
1,3
COMMENTS
From Robert Israel, Dec 29 2017: (Start)
If n = p^d for prime p, then a(n) = p^(2*d-2)*Product_q q^floor(log_q(n)), where the product is over all primes q < n other than p.
Otherwise, a(n) = n^2*Product_p p^floor(log_p(n/p^(nu(n,p)))),
where the product is over all primes p < n and nu(n,p) is the p-adic order of n. (End)
LINKS
Robert Israel, Table of n, a(n) for n = 1..2293
EXAMPLE
After a(1)=a(2)=1, we must have a(3) >= 2 from 2 | a(1+2), and a(3)=2 works.
MAPLE
seq(ilcm(seq(x*(n-x), x=1..n/2)), n=1..50); # Robert Israel, Dec 28 2017
MATHEMATICA
a[n_]:=If[n<=2, 1, LCM@@Table[x(n-x), {x, Floor[n/2]}]]; Table[a[n], {n, 30}] (* Zak Seidov, Jul 11 2010 *)
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
Andrew Weimholt, Jul 05 2010
STATUS
approved