A113047 - OEIS

This site is supported by donations to The OEIS Foundation.

A113047

Binomial(3n,n)/(2n+1) mod 3.

1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,1`
	COMMENTS	`Conjecture: a(n) differs from 0 only when n=(3^j-1)/2,j=0,1,...`
	CROSSREFS	`Cf. A003462, A039969.` `Sequence in context: A015024 A016039 A138149 * A127692 A014305 A023533` `Adjacent sequences: A113044 A113045 A113046 * A113048 A113049 A113050`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Oct 11 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.