id:A085405 - OEIS Search Results

Search: id:A085405

Displaying 1-1 of 1 results found.

page 1

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

+0
3

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

	OFFSET	`0,1`
	COMMENT	`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: A014069 A154388 A029694 this_sequence A036988 A108357 A088517` `Adjacent sequences: A085402 A085403 A085404 this_sequence A085406 A085407 A085408`
	KEYWORD	`nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Jun 29 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research