login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065345 Mod[binomial[2n,n],(n+1)*(n+2)*(n+3)]. 2
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; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROG

(PARI) { for (n=1, 1000, write("b065345.txt", n, " ", binomial(2*n, n) % ((n + 1)*(n + 2)*(n + 3))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 17 2009]

CROSSREFS

A000108, A065344-A065349

Sequence in context: A193653 A147748 A150125 * A130914 A087944 A056616

Adjacent sequences:  A065342 A065343 A065344 * A065346 A065347 A065348

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 30 2001

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:05 EST 2012. Contains 205694 sequences.