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 A065346 #25 Jul 24 2025 15:20:38
%S A065346 2,6,20,70,252,924,3432,990,14300,16588,17472,39676,4760,18360,46512,
%T A065346 29070,30780,87780,0,191268,273240,322920,140400,58500,190008,350784,
%U A065346 402752,611320,81840,649264,41888,164934,264180,295260,1316016,694564
%N A065346 a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).
%H A065346 Chai Wah Wu, <a href="/A065346/b065346.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harry J. Smith)
%H A065346 C. Pomerance, <a href="https://math.dartmouth.edu/~carlp/catalan5.pdf">Divisors of the middle binomial coefficient</a>, Amer. Math. Monthly, 112 (2015), 636-644.
%t A065346 Table[Mod[Binomial[2 n, n], (n + 1) (n + 2) ((n + 3) (n + 4))], {n, 100}] (* _Bruno Berselli_, Jan 06 2014 *)
%o A065346 (PARI) a(n) = { binomial(2*n, n) % ((n + 1)*(n + 2)*(n + 3)*(n + 4)) } \\ _Harry J. Smith_, Oct 17 2009
%Y A065346 Cf. A000108, A065344, A065345, A065347, A065348, A065349.
%K A065346 nonn
%O A065346 1,1
%A A065346 _Labos Elemer_, Oct 30 2001