login
A067770
a(n) = Catalan(n) mod (n+2).
2
1, 1, 2, 0, 2, 0, 4, 6, 0, 0, 8, 0, 0, 10, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 20, 0, 16, 22, 0, 0, 12, 0, 0, 13, 0, 0, 14, 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, 54, 0, 0, 56, 0, 0, 58, 0, 0
OFFSET
0,3
LINKS
MAPLE
a:= n-> binomial(2*n, n)/(n+1) mod (n+2):
seq(a(n), n=0..88);
PROG
(PARI) for(k=0, 80, print1(binomial(2*k, k)/(k+1)%(k+2), ", ")) \\ Hugo Pfoertner, Jul 16 2020
(Python)
A067770_list, c = [1, 1], 1
for n in range(2, 10001):
c = c*(4*n-2)//(n+1)
A067770_list.append(c % (n+2)) # Chai Wah Wu, Jul 16 2020
CROSSREFS
Sequence in context: A372554 A288182 A072680 * A079200 A011420 A035686
KEYWORD
nonn
AUTHOR
Claude Lenormand (claude.lenormand(AT)free.fr), Feb 05 2002
EXTENSIONS
Name corrected by Hugo Pfoertner, Jul 16 2020
STATUS
approved