login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065350 Mod( binomial(2*n, n), (n+1)*(n+1) ). 4
2, 6, 4, 20, 0, 42, 40, 72, 20, 110, 120, 156, 56, 0, 208, 272, 108, 342, 200, 378, 176, 506, 432, 600, 260, 459, 0, 812, 840, 930, 928, 396, 476, 490, 360, 1332, 608, 1131, 1200, 1640, 0, 1806, 880, 0, 920, 2162, 864, 2352, 1100, 1224, 208, 2756, 1296, 2145 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(A002503(n)) = 0. - Reinhard Zumkeller, Sep 16 2014
LINKS
MATHEMATICA
Table[Mod[Binomial[2 n, n], (n + 1)^2], {n, 100}] (* Bruno Berselli, Jan 06 2014 *)
PROG
(PARI) { for (n=1, 1000, write("b065350.txt", n, " ", binomial(2*n, n) % (n + 1)^2) ) } \\ Harry J. Smith, Oct 17 2009
(Haskell)
a065350 n = a065350_list !! (n-1)
a065350_list = zipWith mod (tail a000984_list) (drop 2 a000290_list)
-- Reinhard Zumkeller, Sep 16 2014
CROSSREFS
Sequence in context: A282902 A033457 A133936 * A333923 A063427 A066092
KEYWORD
nonn
AUTHOR
Labos Elemer, Oct 30 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)