id:A106737 - OEIS Search Results

Search: id:A106737

Displaying 1-1 of 1 results found.

page 1

a(n)=sum(k=0,n,{binomial(n+k,n-k))*binomial(n,k)} mod 2).

+0
1

1, 2, 2, 3, 2, 4, 3, 4, 2, 4, 4, 6, 3, 6, 4, 5, 2, 4, 4, 6, 4, 8, 6, 8, 3, 6, 6, 9, 4, 8, 5, 6, 2, 4, 4, 6, 4, 8, 6, 8, 4, 8, 8, 12, 6, 12, 8, 10, 3, 6, 6, 9, 6, 12, 9, 12, 4, 8, 8, 12, 5, 10, 6, 7, 2, 4, 4, 6, 4, 8, 6, 8, 4, 8, 8, 12, 6, 12, 8, 10, 4, 8, 8, 12, 8, 16, 12, 16, 6, 12, 12, 18, 8, 16, 10, 12 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(0)=0, a(2n)=a(n), a(4n+1)=2a(2n), a(4n+3)=2a(2n+1)-a(n)`
	CROSSREFS	`Sequence in context: A066241 A060025 A067399 this_sequence A062821 A162897 A103391` `Adjacent sequences: A106734 A106735 A106736 this_sequence A106738 A106739 A106740`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 15 2005`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research