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 A049077 #30 Mar 22 2020 09:58:57
%S A049077 1,1,1,2,1,3,1,4,1,5,1,1,1,7,1,8,1,9,1,5,1,11,1,6,1,13,1,7,1,1,1,16,1,
%T A049077 17,1,3,1,19,1,2,1,7,1,11,1,23,1,4,1,25,1,13,1,27,1,1,1,29,1,15,1,31,
%U A049077 1,32,1,11,1,17,1,5,1,18,1,37,1,19,1,39,1,4,1,41,1,1,1,43,1,11,1,1,1,23
%N A049077 a(n) = n / gcd(n, binomial(n, floor(n/2))).
%H A049077 Hugo Pfoertner, <a href="/A049077/b049077.txt">Table of n, a(n) for n = 1..10000</a>
%F A049077 For odd n, a(n) = 1. For even n, a(n) is either n/2 or smaller.
%e A049077 For n = 12, gcd(12, binomial(12, 6)) = gcd(12, 924) = 12, so a(12) = 1.
%p A049077 swing := n -> n!/iquo(n,2)!^2: seq(n/igcd(n,swing(n)),n=1..92); # _Peter Luschny_, May 16 2013
%t A049077 Flatten[Table[{1, n/GCD[n, Binomial[n, n/2]]}, {n, 2, 100, 2}]] (* _Alonso del Arte_, May 17 2013 *)
%o A049077 (PARI) a(n) = n/gcd(n, binomial(n, n\2)); \\ _Michel Marcus_, Mar 22 2020
%Y A049077 Cf. A001405, A057815, A014973.
%K A049077 nonn
%O A049077 1,4
%A A049077 _Labos Elemer_, Nov 13 2000
%E A049077 Offset changed to 1 by _Peter Luschny_, May 16 2013