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 A208448 #17 Feb 11 2025 06:59:35
%S A208448 1,1,1,2,2,6,2,8,24,60,12,288,96,84,60,3840,384,15552,576,14400,20160,
%T A208448 221760,576,331776,552960,224640,51840,20321280,2903040,108864000,
%U A208448 345600,17694720,145981440,51701760,1935360,11287019520,1254113280,2978519040,10782720
%N A208448 Greatest common divisors of consecutive floor-factorial numbers (A010786).
%H A208448 Reinhard Zumkeller, <a href="/A208448/b208448.txt">Table of n, a(n) for n = 1..1000</a>
%F A208448 a(n) = GCD(A010786(n+1),A010786(n)).
%t A208448 GCD @@@ Partition[#, 2, 1] & [Array[Product[Quotient[#, k], {k, #}] &, 30]] (* _Paolo Xausa_, Feb 11 2025 *)
%o A208448 (Haskell)
%o A208448 a208448 n = a208448_list !! (n-1)
%o A208448 a208448_list = zipWith gcd a010786_list $ tail a010786_list
%o A208448 (PARI) f(n) = prod(k=1, n, n\k); \\ A010786
%o A208448 a(n) = gcd(f(n+1), f(n)); \\ _Michel Marcus_, Feb 03 2022
%Y A208448 Cf. A010786, A208449, A208450.
%K A208448 nonn
%O A208448 1,4
%A A208448 _Reinhard Zumkeller_, Feb 26 2012