This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A360283 #11 Feb 15 2023 09:41:38
%S A360283 1,1,4,18,288,1200,43200,529200,11289600,91445760,9144576000,
%T A360283 92207808000,13277924352000,160283515392000,2094371267788800,
%U A360283 58904191906560000,15079473128079360000,242109318556385280000,78443419212268830720000,1415903716781452394496000
%N A360283 a(n) = lcm({n! * binomial(n, k) for k = 0..n}).
%F A360283 a(n) = n! * lcm({k for k = 1..n+1}) / (n+1) = n! * LCM(n + 1) / (n + 1).
%F A360283 a(n) / a(n-1) = n^2 if and only if n + 1 is prime, for n >= 1.
%p A360283 a := n -> ilcm(seq(n!*binomial(n, k), k=0..n)):
%p A360283 seq(a(n), n = 0..19);
%o A360283 (Python)
%o A360283 from math import factorial, lcm
%o A360283 def A360283(n): return factorial(n)*lcm(*(i for i in range(1,n+2)))//(n+1) # _Chai Wah Wu_, Feb 15 2023
%Y A360283 Cf. A002397, A003418 (LCM), A005722, A021012, A196347.
%K A360283 nonn
%O A360283 0,3
%A A360283 _Peter Luschny_, Feb 14 2023