id:A130706 - OEIS Search Results

Search: id:A130706

Displaying 1-1 of 1 results found.

page 1

a(0)=1, a(1)=2, a(n)=0 for n>1.

+0
8

1, 2, 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, 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; listen)

	OFFSET	`0,2`
	COMMENT	`Inverse binomial transform of A005408.`
	FORMULA	`G.f.: 1+2x.` `a(n)=[C(2n,n) mod 2]+2*[C((n+1)^2,n+3) mod 2], n>=0 - Paolo P. Lava (ppl(AT)spl.at), Oct 22 2007`
	CROSSREFS	`Sequence in context: A063665 A072507 A130779 this_sequence A000038 A063667 A014083` `Adjacent sequences: A130703 A130704 A130705 this_sequence A130707 A130708 A130709`
	KEYWORD	`easy,nonn`
	AUTHOR	`Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jun 27 2007`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research