A085405 - OEIS

This site is supported by donations to The OEIS Foundation.

A085405

Common residues of binomial(3n+2,n+1)/(3n+2) modulo 2.

1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 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	`The positions of ones are given by A022340 and runs of zeros are given by A085407: both are related to the Fibonacci sequence.`
	FORMULA	`a(n) = C(3n+2, n+1)/(3n+2) (Mod 2) = A006013(n) (Mod 2), where A006013 is the self-convolution of A001764 (ternary trees).`
	CROSSREFS	`Cf. A006013, A022340 (ones), A085407 (zeros), A085357.` `Cf. A085357.` `Sequence in context: A154388 A029694 A171894 * A036988 A108357 A088517` `Adjacent sequences: A085402 A085403 A085404 * A085406 A085407 A085408`
	KEYWORD	`nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Jun 29 2003`

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

Last modified February 15 09:54 EST 2012. Contains 205763 sequences.