A003418 a(0) = 1; for n >= 1, a(n) = least common multiple (or lcm) of {1, 2, ..., n}
An assertion equivalent to the Riemann hypothesis is: | log(a(n)) - n | < sqrt(n) * log(n)^2. - Lekraj Beedassy (blekraj(AT)yahoo.com), Aug 27 2006
According to my computations the inequality fails for n in {1,2}.