login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065344 a(n) = Mod( binomial(2*n,n), (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 (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, 100}] (* Bruno Berselli, Jan 06 2014 *)

PROG

(PARI) { for (n=1, 1000, write("b065344.txt", n, " ", binomial(2*n, n) % ((n + 1)*(n + 2))) ) } \\ Harry J. Smith, Oct 17 2009

CROSSREFS

Cf. A000108, A065345, A065346, A065347, A065348, A065349.

Sequence in context: A227805 A267314 A180314 * A131105 A321713 A057635

Adjacent sequences:  A065341 A065342 A065343 * A065345 A065346 A065347

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 26 14:08 EST 2020. Contains 331280 sequences. (Running on oeis4.)