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 A053214 #18 Jul 02 2025 16:01:59
%S A053214 1,0,2,2,6,2,0,2,6,2,16,2,4,2,20,0,6,2,24,2,20,6,28,2,12,2,32,20,0,2,
%T A053214 4,2,6,42,40,42,52,2,44,20,20,2,0,2,48,0,52,2,60,2,56,54,96,2,60,32,
%U A053214 88,96,64,2,96,2,68,12,70,70,0,2,36,66,40,2,36,2,80,120,32,0,144,2,20,20,88
%N A053214 Central binomial coefficients (A000984) read mod 2n, with a(0)=1.
%H A053214 G. C. Greubel, <a href="/A053214/b053214.txt">Table of n, a(n) for n = 0..10000</a>
%F A053214 a(n) = binomial(2*n, n) mod 2*n, with a(0)=1.
%F A053214 a(n) = A053200(2*n,n) for n > 0. - _Reinhard Zumkeller_, Jan 01 2013
%t A053214 Join[{1}, Table[Mod[Binomial[2*n, n], 2*n], {n, 1, 100}]] (* _G. C. Greubel_, Sep 04 2018 *)
%o A053214 (Haskell)
%o A053214 a053214 0 = 1
%o A053214 a053214 n = a053200 (2 * n) n -- _Reinhard Zumkeller_, Jan 24 2014
%o A053214 (PARI) concat([1], vector(100, n, lift(Mod(binomial(2*n,n), 2*n)))) \\ _G. C. Greubel_, Sep 04 2018
%Y A053214 Cf. A059288, A059289.
%K A053214 nonn,easy
%O A053214 0,3
%A A053214 _Asher Auel_, Dec 16 1999
%E A053214 More terms from _James Sellers_, Dec 18 1999