id:A101623 - OEIS Search Results

Search: id:A101623

Displaying 1-1 of 1 results found.

page 1

Modular binomial transform of 10^n.

+0
2

1, 1, 11, 1, 111, 101, 1011, 1, 10111, 10101, 111011, 10001, 1100111, 1000101, 10001011, 1, 100010111, 100010101, 1100111011, 100010001, 11101100111, 10101000101, 101110001011, 100000001, 1011000010111, 1010000010101 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`A101624 in binary.`
	FORMULA	`a(n)=sum{k=0..floor(n/2), mod(binomial(n-k, k), 2)*10^k}.` `a(n)=sum{k=0..n, mod(binomial(k, n-k), 2)10^(n-k)};`
	CROSSREFS	`Sequence in context: A038713 A130556 A120449 this_sequence A038315 A093158 A132098` `Adjacent sequences: A101620 A101621 A101622 this_sequence A101624 A101625 A101626`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 10 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research