A131381 a(n) = binomial(2*n,n) mod (n+2), with n>=1.
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
Offset: 1
Examples
n=6 -> binomial(12,6) mod 8 -> 12!/(6!*6!) mod 8 -> 924 mod 8 -> 4.
Links
- Michael De Vlieger, Table of n, a(n) for n = 1..10000
Programs
-
Maple
seq(binomial(2*n,n) mod (n+2), n=1..100);
-
Mathematica
Table[Mod[Binomial[2n,n],n+2],{n,100}] (* Harvey P. Dale, Aug 23 2011 *)
Extensions
Offset changed to 1 by Georg Fischer, Oct 06 2024
Comments