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