id:A118112 - OEIS Search Results

Search: id:A118112

Displaying 1-1 of 1 results found.

page 1

Residue of C[3n,n] modulo (n+1).

+0
3

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; listen)

	OFFSET	`1,5`
	COMMENT	`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 this_sequence A081805 A084681 A096528` `Adjacent sequences: A118109 A118110 A118111 this_sequence A118113 A118114 A118115`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana1.sote.hu), Apr 13 2006`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research