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”).

A053214
Central binomial coefficients (A000984) read mod 2n, with a(0)=1.
6
1, 0, 2, 2, 6, 2, 0, 2, 6, 2, 16, 2, 4, 2, 20, 0, 6, 2, 24, 2, 20, 6, 28, 2, 12, 2, 32, 20, 0, 2, 4, 2, 6, 42, 40, 42, 52, 2, 44, 20, 20, 2, 0, 2, 48, 0, 52, 2, 60, 2, 56, 54, 96, 2, 60, 32, 88, 96, 64, 2, 96, 2, 68, 12, 70, 70, 0, 2, 36, 66, 40, 2, 36, 2, 80, 120, 32, 0, 144, 2, 20, 20, 88
OFFSET
0,3
LINKS
FORMULA
a(n) = binomial(2*n, n) mod 2*n, with a(0)=1.
a(n) = A053200(2*n,n) for n > 0. - Reinhard Zumkeller, Jan 01 2013
MATHEMATICA
Join[{1}, Table[Mod[Binomial[2*n, n], 2*n], {n, 1, 100}]] (* G. C. Greubel, Sep 04 2018 *)
PROG
(Haskell)
a053214 0 = 1
a053214 n = a053200 (2 * n) n -- Reinhard Zumkeller, Jan 24 2014
(PARI) concat([1], vector(100, n, lift(Mod(binomial(2*n, n), 2*n)))) \\ G. C. Greubel, Sep 04 2018
CROSSREFS
Sequence in context: A016529 A077894 A374031 * A077198 A046110 A296091
KEYWORD
nonn,easy
AUTHOR
Asher Auel, Dec 16 1999
EXTENSIONS
More terms from James A. Sellers, Dec 18 1999
STATUS
approved