id:A130779 - OEIS Search Results

Search: id:A130779

Displaying 1-1 of 1 results found.

page 1

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

+0
6

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 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Inverse binomial transform of A002522. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 13 2008`
	FORMULA	`G.F.:1+x+2x^2` `a(n)=[C((n+2)^2,n+4) mod 2]+[C((n+1)^2,n+3) mod 2]+2*[C(n^2,n+2) mod 2] - Paolo P. Lava (ppl(AT)spl.at), Dec 19 2007`
	CROSSREFS	`Cf. A130706.` `Sequence in context: A083919 A063665 A072507 this_sequence A130706 A000038 A063667` `Adjacent sequences: A130776 A130777 A130778 this_sequence A130780 A130781 A130782`
	KEYWORD	`nonn`
	AUTHOR	`Paul Curtz, Jul 14 2007`
	EXTENSIONS	`Terms added by Michael Porter (michael_b_porter(AT)yahoo.com), Nov 05 2009`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research