Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Feb 03 2022 09:31:22
%S 1,1,1,2,2,6,2,8,24,60,12,288,96,84,60,3840,384,15552,576,14400,20160,
%T 221760,576,331776,552960,224640,51840,20321280,2903040,108864000,
%U 345600,17694720,145981440,51701760,1935360,11287019520,1254113280,2978519040,10782720
%N Greatest common divisors of consecutive floor-factorial numbers (A010786).
%H Reinhard Zumkeller, <a href="/A208448/b208448.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = GCD(A010786(n+1),A010786(n)).
%o (Haskell)
%o a208448 n = a208448_list !! (n-1)
%o a208448_list = zipWith gcd a010786_list $ tail a010786_list
%o (PARI) f(n) = prod(k=1, n, n\k); \\ A010786
%o a(n) = gcd(f(n+1), f(n)); \\ _Michel Marcus_, Feb 03 2022
%Y Cf. A010786, A208449, A208450.
%K nonn
%O 1,4
%A _Reinhard Zumkeller_, Feb 26 2012