id:A100735 - OEIS Search Results

Search: id:A100735

Displaying 1-1 of 1 results found.

page 1

Inverse modulo 2 binomial transform of 2^n.

+0
3

1, 1, 3, 3, 15, 15, 45, 45, 255, 255, 765, 765, 3825, 3825, 11475, 11475, 65535, 65535, 196605, 196605, 983025, 983025, 2949075, 2949075, 16711425, 16711425, 50134275, 50134275, 250671375, 250671375, 752014125, 752014125, 4294967295, 4294967295 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`2^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)A100735(k)}.`
	FORMULA	`a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)2^k}.`
	CROSSREFS	`Sequence in context: A163590 A114320 A086116 this_sequence A129356 A055634 A133221` `Adjacent sequences: A100732 A100733 A100734 this_sequence A100736 A100737 A100738`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 06 2004`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research