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 A065350 #16 Dec 12 2024 11:09:50
%S A065350 2,6,4,20,0,42,40,72,20,110,120,156,56,0,208,272,108,342,200,378,176,
%T A065350 506,432,600,260,459,0,812,840,930,928,396,476,490,360,1332,608,1131,
%U A065350 1200,1640,0,1806,880,0,920,2162,864,2352,1100,1224,208,2756,1296,2145
%N A065350 a(n) = binomial(2*n, n) mod (n+1)^2.
%C A065350 a(A002503(n)) = 0. - _Reinhard Zumkeller_, Sep 16 2014
%H A065350 Harry J. Smith, <a href="/A065350/b065350.txt">Table of n, a(n) for n = 1..1000</a>
%t A065350 Table[Mod[Binomial[2 n, n], (n + 1)^2], {n, 100}] (* _Bruno Berselli_, Jan 06 2014 *)
%o A065350 (PARI) a(n) = { binomial(2*n, n) % (n + 1)^2 } \\ _Harry J. Smith_, Oct 17 2009
%o A065350 (Haskell)
%o A065350 a065350 n = a065350_list !! (n-1)
%o A065350 a065350_list = zipWith mod (tail a000984_list) (drop 2 a000290_list)
%o A065350 -- _Reinhard Zumkeller_, Sep 16 2014
%Y A065350 Cf. A000108, A065344-A065349, A002503.
%Y A065350 Cf. A002503, A000984, A000290.
%K A065350 nonn
%O A065350 1,1
%A A065350 _Labos Elemer_, Oct 30 2001