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 A006197 M2297 #19 May 27 2024 02:27:03
%S A006197 3,4,3,3,5,5,5,4,3,3,5,3,3,7,7,4,7,8,9,8,7,7,7,7,5,5,3,3,9,3,3,4,8,8,
%T A006197 5,3,3,9,3,3,13,13,13,11,11,11,11,8,7,5,5,5,13,9,5,5,5,7,7,5,5,5,7,4,
%U A006197 7,7,9,8,13,7,7
%N A006197 Least number not dividing binomial(2n,n).
%C A006197 All terms are prime powers (A246655). [Corrected by _Amiram Eldar_, May 27 2024]
%D A006197 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006197 T. D. Noe, <a href="/A006197/b006197.txt">Table of n, a(n) for n=1..10000</a>
%H A006197 P. Erdős, R. L. Graham, I. Z. Russa and E. G. Straus, <a href="http://dx.doi.org/10.1090/S0025-5718-1975-0369288-3">On the prime factors of C(2n,n)</a>, Math. Comp. 29 (1975), 83-92.
%F A006197 a(n) = A007978(A000984(n)). - _Amiram Eldar_, May 27 2024
%t A006197 a[n_] := Module[{k = 1, b = Binomial[2*n, n]}, While[Divisible[b, k], k++]; k]; Array[a, 100] (* _Amiram Eldar_, May 27 2024 *)
%Y A006197 Cf. A000984, A007978, A246655.
%K A006197 nonn
%O A006197 1,1
%A A006197 _N. J. A. Sloane_