login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118114 a(n) = binomial(3n,n) mod((n+1)(n+2)). 2
3, 3, 4, 15, 21, 28, 0, 81, 55, 99, 0, 0, 84, 120, 0, 153, 171, 285, 0, 231, 253, 0, 360, 0, 0, 0, 0, 522, 0, 496, 0, 561, 833, 945, 0, 703, 741, 156, 0, 861, 903, 1419, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2016, 1664, 2145, 2211, 3417, 0, 2415, 2485, 2556, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Compared with A118112: larger nonzero value more often and in non-monotonic order.
LINKS
EXAMPLE
For n=5, binomial(15,5) = 3003 = (5+1)*(5+2)*71 + 21, a(5) = 21, the residue.
Interestingly, a very large zone of zeros occurs between about n=5460 and n=7800, uninterrupted by nonzero residues.
MAPLE
seq(binomial(3*n, n) mod((n+1)*(n+2)), n=1..71); # Emeric Deutsch, Apr 15 2006
MATHEMATICA
Table[Mod[Binomial[3*k, k], (k + 1)*(k + 2)], {k, 1, 1000}]
PROG
(PARI) a(n) = binomial(3*n, n) % ((n+1)*(n+2)); \\ Michel Marcus, Jan 05 2017
CROSSREFS
Sequence in context: A362107 A364910 A291873 * A366555 A266067 A300368
KEYWORD
nonn
AUTHOR
Labos Elemer, Apr 13 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 04:12 EDT 2024. Contains 371782 sequences. (Running on oeis4.)