A100741 - OEIS

This site is supported by donations to The OEIS Foundation.

A100741

Inverse modulo 2 modulo transform of 8^n.

1, 7, 63, 441, 4095, 28665, 257985, 1805895, 16777215, 117440505, 1056964545, 7398751815, 68702695425, 480918867975, 4328269811775, 30297888682425, 281474976710655, 1970324836974585, 17732923532771265, 124130464729398855 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`8^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)A100741(k)}.`
	FORMULA	`a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)8^k}.`
	CROSSREFS	`Sequence in context: A007291 A188226 A055405 * A043027 A165759 A166153` `Adjacent sequences: A100738 A100739 A100740 * A100742 A100743 A100744`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 06 2004`

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

Last modified February 16 05:32 EST 2012. Contains 205860 sequences.