|
| |
|
|
A118112
|
|
Residue of C[3n,n] modulo (n+1).
|
|
2
| |
|
|
1, 0, 0, 0, 3, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0, 0, 19, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 35, 0, 0, 0, 37, 0, 0, 0, 0, 0, 0, 0, 41, 0, 0, 0, 43, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,5
|
|
|
COMMENTS
| These divisibilities are analogous to those of Catalan numbers. For rather long sequences of consecutive integers, a(n)=0. For the first 10000 integers 9678 residues equals zero. See A118113.
|
|
|
FORMULA
| a(n)=Mod(C(3n,n),n+1).
|
|
|
EXAMPLE
| n=9, C[27,7]=4686825, Mod[4686825,10]=5
|
|
|
MATHEMATICA
| Table[Binomial[3*k, k], {k, 1, 10000}]
|
|
|
CROSSREFS
| Cf. A000108, A118113.
Sequence in context: A151671 A122480 A096133 * A195938 A184762 A081805
Adjacent sequences: A118109 A118110 A118111 * A118113 A118114 A118115
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana1.sote.hu), Apr 13 2006
|
| |
|
|
