A101680 - OEIS

This site is supported by donations to The OEIS Foundation.

A101680

A modular binomial transform of 10^n.

1, 11, 111, 1011, 10111, 111011, 1100111, 10001011, 100010111, 1100111011, 11101100111, 101110001011, 1011000010111, 11100000111011, 110000001100111, 1000000010001011, 10000000100010111, 110000001100111011 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`A099902 in binary. Bisection of A101623.`
	FORMULA	`a(n)=sum{k=0..n, mod(binomial(2n-k, k), 2)10^k}`
	CROSSREFS	`Sequence in context: A049121 A143573 A058947 * A164553 A185000 A110437` `Adjacent sequences: A101677 A101678 A101679 * A101681 A101682 A101683`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 11 2004`

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

Last modified February 14 07:08 EST 2012. Contains 205583 sequences.