This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..10000 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 Cf. A059288, A059289. Sequence in context: A225975 A016529 A077894 * A077198 A046110 A296091 Adjacent sequences:  A053211 A053212 A053213 * A053215 A053216 A053217 KEYWORD nonn,easy AUTHOR Asher Auel (asher.auel(AT)reed.edu), Dec 16 1999 EXTENSIONS More terms from James A. Sellers, Dec 18 1999 STATUS approved

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

Last modified October 22 18:55 EDT 2018. Contains 316500 sequences. (Running on oeis4.)