This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065346 a(n) = Mod( binomial(2*n, n), (n+1)*(n+2)*(n+3)*(n+4) ). 6
 2, 6, 20, 70, 252, 924, 3432, 990, 14300, 16588, 17472, 39676, 4760, 18360, 46512, 29070, 30780, 87780, 0, 191268, 273240, 322920, 140400, 58500, 190008, 350784, 402752, 611320, 81840, 649264, 41888, 164934, 264180, 295260, 1316016, 694564 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 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 + 3) (n + 4))], {n, 100}] (* Bruno Berselli, Jan 06 2014 *) PROG (PARI) { for (n=1, 1000, write("b065346.txt", n, " ", binomial(2*n, n) % ((n + 1)*(n + 2)*(n + 3)*(n + 4))) ) } \\ Harry J. Smith, Oct 17 2009 CROSSREFS Cf. A000108, A065344, A065345, A065347, A065348, A065349. Sequence in context: A302644 A087944 A056616 * A302645 A071976 A302646 Adjacent sequences:  A065343 A065344 A065345 * A065347 A065348 A065349 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 17:24 EDT 2018. Contains 316392 sequences. (Running on oeis4.)