Pseudofactorial

Dyalog APL, 3 bytes

∧/⍳

APL beats Jelly‽

⍳ 1 though argument

∧/ LCM across

Jelly, 4 bytes

Ræl/

Try it online! or verify all test cases.

How it works

Ræl/  Main link. Input: n

R     Range; yield [1, ..., n].
   /  Reduce the range...
 æl     by LCM.

Haskell, 20 bytes

f x=foldr1 lcm[1..x]

Usage example: map f [1..7] -> [1,2,6,12,60,60,420].

The lcm trick in Haskell.