This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059288 a(n) = binomial(2*n,n) mod n. 8
 0, 0, 2, 2, 2, 0, 2, 6, 2, 6, 2, 4, 2, 6, 0, 6, 2, 6, 2, 0, 6, 6, 2, 12, 2, 6, 20, 0, 2, 4, 2, 6, 9, 6, 7, 16, 2, 6, 20, 20, 2, 0, 2, 4, 0, 6, 2, 12, 2, 6, 3, 44, 2, 6, 32, 32, 39, 6, 2, 36, 2, 6, 12, 6, 5, 0, 2, 36, 66, 40, 2, 36, 2, 6, 45, 32, 0, 66, 2, 20, 20, 6, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS T. D. Noe, Table of n, a(n) for n=1..5000 FORMULA a(n) = Catalan(n) mod n. - Jonathan Sondow, Dec 13 2013 MAPLE binomial(2*n, n) mod n; seq(irem(binomial(2*n, n), n), n=1..83); - Zerinvary Lajos, Apr 20 2008 MATHEMATICA Table[Mod[Binomial[2*n, n], n], {n, 1, 25}] (* G. C. Greubel, Jan 04 2017 *) PROG (PARI) { for (n = 1, 5000, write("b059288.txt", n, " ", binomial(2*n, n) % n); ) } \\ Harry J. Smith, Jun 25 2009 CROSSREFS Cf. A053214, A059289, A000108. Sequence in context: A274850 A215594 A230291 * A319109 A217670 A243310 Adjacent sequences:  A059285 A059286 A059287 * A059289 A059290 A059291 KEYWORD nonn AUTHOR N. J. A. Sloane, Jan 25 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 20:06 EST 2018. Contains 318087 sequences. (Running on oeis4.)