|
|
A246714
|
|
Catalan(n) mod prime(n).
|
|
5
|
|
|
1, 2, 0, 0, 9, 2, 4, 5, 9, 5, 10, 35, 21, 12, 14, 45, 19, 38, 36, 20, 54, 54, 19, 10, 83, 40, 101, 4, 20, 8, 16, 18, 53, 127, 25, 139, 4, 54, 149, 127, 176, 156, 71, 17, 65, 196, 10, 211, 221, 205, 63, 138, 137, 234, 254, 194, 67, 243, 155, 145, 164, 203, 76, 187, 272
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Since prime(n) > 2*n for n > 4, the only occurrences of 0 are at n = 3 and 4. Are there any occurrences of 1 after n = 1? - Robert Israel, Sep 02 2014
|
|
LINKS
|
|
|
MAPLE
|
seq(binomial(2*n, n)/(n+1) mod ithprime(n), n=1..100); # Robert Israel, Sep 02 2014
|
|
MATHEMATICA
|
Table[Mod[CatalanNumber[n], Prime[n]], {n, 65}] (* Alonso del Arte, Sep 02 2014 *)
|
|
PROG
|
(Magma) [Catalan(n) mod NthPrime(n): n in [1..70]];
(Python)
from sympy import prime
from gmpy2 import divexact, t_mod
for n in range(2, 10**3):
....c = divexact(c*(4*n-2), (n+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|