id:A042970 - OEIS Search Results

Search: id:A042970

Displaying 1-1 of 1 results found.

page 1

Remainder when central binomial coefficient C(2n,n) is divided by n: Mod(C(n,[ n/2 ]), n).

+0
1

0, 0, 0, 2, 0, 2, 0, 6, 0, 2, 0, 0, 0, 2, 0, 6, 0, 2, 0, 16, 0, 2, 0, 4, 0, 2, 0, 20, 0, 0, 0, 6, 0, 2, 0, 24, 0, 2, 0, 20, 0, 6, 0, 28, 0, 2, 0, 12, 0, 2, 0, 32, 0, 20, 0, 0, 0, 2, 0, 4, 0, 2, 0, 6, 0, 42, 0, 40, 0, 42, 0, 52, 0, 2, 0, 44, 0, 20, 0, 20, 0, 2, 0, 0, 0, 2, 0, 48, 0, 0, 0, 52, 0, 2, 0 (list; graph; listen)

	OFFSET	`1,4`
	EXAMPLE	`n=10, C(10,5)=252 thus Mod(252,10)=2=a(10).`
	CROSSREFS	`Cf. A001405, A020475.` `Sequence in context: A035686 A037228 A002117 this_sequence A158327 A136581 A066285` `Adjacent sequences: A042967 A042968 A042969 this_sequence A042971 A042972 A042973`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research