login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A065344
a(n) = binomial(2*n,n) mod ((n+1)*(n+2)).
10
2, 6, 0, 10, 0, 28, 48, 0, 0, 88, 0, 0, 140, 120, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 468, 0, 0, 580, 0, 496, 704, 0, 0, 420, 0, 0, 494, 0, 0, 574, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2016, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4320, 0, 0, 4648, 0, 0, 4988, 0, 0
OFFSET
1,1
LINKS
C. Pomerance, Divisors of the middle binomial coefficient, Amer. Math. Monthly, 112 (2015), 636-644.
MATHEMATICA
Table[Mod[Binomial[2 n, n], (n + 1) (n + 2)], {n, 100}] (* Bruno Berselli, Jan 06 2014 *)
PROG
(PARI) a(n) = { binomial(2*n, n) % ((n + 1)*(n + 2)) } \\ Harry J. Smith, Oct 17 2009
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Labos Elemer, Oct 30 2001
STATUS
approved