Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065346
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065346 Mod[binomial[2n,n],(n+1)*(n+2)*(n+3)*(n+4)]. +0
2
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; listen)
OFFSET

1,1

LINKS

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

PROGRAM

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

CROSSREFS

Cf. A000108, A065344-A065349

Sequence in context: A130914 A087944 A056616 this_sequence A071976 A000984 A087433

Adjacent sequences: A065343 A065344 A065345 this_sequence A065347 A065348 A065349

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research