|
| |
|
|
A131381
|
|
a(n)=binomial(2*n,n) mod (n+2)), with n>=1.
|
|
0
| |
|
|
2, 2, 0, 4, 0, 4, 3, 0, 0, 4, 0, 0, 5, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 10, 0, 16, 11, 0, 0, 24, 0, 0, 26, 0, 0, 28, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, 0, 28, 0, 0, 29, 0, 0, 60, 0, 0, 62, 0, 0, 64, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Contains large zones of zeros
|
|
|
EXAMPLE
| n=6 -> binomial(12,6) mod 8 -> 12!/(6!*6!) mod 8 -> 924 mod 8 -> 4
|
|
|
MAPLE
| P:=proc(n) local i, j; for i from 1 by 1 to n do j:=(binomial(2*i, i) mod (i+2)); print(j); od; end: P(200);
|
|
|
MATHEMATICA
| Table[Mod[Binomial[2n, n], n+2], {n, 100}] (* From Harvey P. Dale, Aug 23 2011 *)
|
|
|
CROSSREFS
| Cf. A118114, A131382.
Sequence in context: A167001 A108563 A138476 * A112080 A052176 A138092
Adjacent sequences: A131378 A131379 A131380 * A131382 A131383 A131384
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Jul 05 2007
|
| |
|
|
