login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065345 a(n) = Mod( binomial(2*n,n), (n+1)*(n+2)*(n+3) ). 6
2, 6, 20, 70, 252, 420, 552, 0, 1100, 1144, 0, 1456, 1400, 2040, 2448, 0, 3420, 0, 0, 0, 6072, 5520, 0, 5850, 13104, 0, 12992, 17980, 22320, 27280, 5984, 7854, 7140, 15540, 0, 36556, 13832, 0, 45920, 24682, 0, 0, 0, 0, 51888, 0, 23520, 0, 0, 0, 0, 94446, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
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, 60}] (* Harvey P. Dale, Feb 21 2012 *)
PROG
(PARI) { for (n=1, 1000, write("b065345.txt", n, " ", binomial(2*n, n) % ((n + 1)*(n + 2)*(n + 3))) ) } \\ Harry J. Smith, Oct 17 2009
CROSSREFS
Sequence in context: A150125 A360295 A224514 * A130914 A302644 A087944
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 14:43 EDT 2024. Contains 371749 sequences. (Running on oeis4.)