id:A101680 - OEIS Search Results

Search: id:A101680

Displaying 1-1 of 1 results found.

page 1

A modular binomial transform of 10^n.

+0
1

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

	OFFSET	`0,2`
	COMMENT	`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 this_sequence A164553 A110437 A110444` `Adjacent sequences: A101677 A101678 A101679 this_sequence A101681 A101682 A101683`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 11 2004`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research