A130706 - OEIS

This site is supported by donations to The OEIS Foundation.

A130706

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

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; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`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 (paoloplava(AT)gmail.com), Oct 22 2007`
	CROSSREFS	`Sequence in context: A063665 A072507 A130779 * A000038 A063667 A014083` `Adjacent sequences: A130703 A130704 A130705 * A130707 A130708 A130709`
	KEYWORD	`easy,nonn`
	AUTHOR	`Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jun 27 2007`

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

Last modified February 15 14:37 EST 2012. Contains 205822 sequences.