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 A056612 #37 May 23 2020 02:18:16
%S A056612 1,1,1,2,2,36,36,144,144,1440,1440,17280,17280,241920,3628800,
%T A056612 29030400,29030400,1567641600,1567641600,156764160000,9876142080000,
%U A056612 217275125760000,217275125760000,1738201006080000,1738201006080000
%N A056612 a(n) = gcd(n!, n!*(1 + 1/2 + 1/3 + ... + 1/n)).
%C A056612 The first difference between this sequence and A131657 occurs for n = 20, while the first difference between this sequence and A131658 occurs for n = 21. - _Christian Krattenthaler_, Sep 30 2007
%H A056612 Michael De Vlieger, <a href="/A056612/b056612.txt">Table of n, a(n) for n = 1..535</a>
%F A056612 a(n) = A000142(n)/A002805(n) = A000254(n)/A001008(n). - _Franz Vrabec_, Sep 13 2005
%F A056612 a(n) = gcd(A000254(n+1), A000254(n)). - _Petros Hadjicostas_, May 18 2020
%F A056612 a(n) = gcd(Stirling1(n+1, 2), n!). - _Michel Marcus_, May 20 2020
%e A056612 a(4) = gcd(4!, 4!*(1 + 1/2 + 1/3 + 1/4)) = gcd(24, 50) = 2.
%e A056612 a(4) = gcd(A000254(5), A000254(4)) = gcd(5!*(1 + 1/2 + 1/3 + 1/4 + 1/5), 4!*(1 + 1/2 + 1/3 + 1/4)) = gcd(274, 50) = 2. - _Petros Hadjicostas_, May 18 2020
%t A056612 Table[GCD[#, # Total@ Map[1/# &, Range@ n]] &[n!], {n, 25}] (* _Michael De Vlieger_, Sep 23 2017 *)
%t A056612 a[n_] := n!/Denominator@ HarmonicNumber@ n; Array[a, 25] (* _Robert G. Wilson v_, Jun 30 2018 *)
%o A056612 (PARI) a(n) = gcd(n!, n!*sum(k=1, n, 1/k)); \\ _Michel Marcus_, Jul 14 2018
%o A056612 (PARI) a(n) = gcd(stirling(n+1, 2, 1), n!); \\ _Michel Marcus_, May 20 2020
%Y A056612 Cf. A000142, A001008, A002805.
%Y A056612 Cf. A007757, A131657, A131658.
%Y A056612 Cf. A334958 (similar sequence for the alternative harmonic series).
%K A056612 easy,nonn
%O A056612 1,4
%A A056612 _Leroy Quet_, Aug 08 2000