|
Search: id:A065350
|
|
|
| A065350 |
|
Mod[binomial[2*n,n],(n+1)*(n+1)]. |
|
+0
3
|
|
| 2, 6, 4, 20, 0, 42, 40, 72, 20, 110, 120, 156, 56, 0, 208, 272, 108, 342, 200, 378, 176, 506, 432, 600, 260, 459, 0, 812, 840, 930, 928, 396, 476, 490, 360, 1332, 608, 1131, 1200, 1640, 0, 1806, 880, 0, 920, 2162, 864, 2352, 1100, 1224, 208, 2756, 1296, 2145
(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("b065350.txt", n, " ", binomial(2*n, n) % (n + 1)^2) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 17 2009]
|
|
CROSSREFS
|
Cf. A000108, A065344-A065349, A002503.
Sequence in context: A054786 A033457 A133936 this_sequence A063427 A066092 A100695
Adjacent sequences: A065347 A065348 A065349 this_sequence A065351 A065352 A065353
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Oct 30 2001
|
|
|
Search completed in 0.002 seconds
|
