id:A101678 - OEIS Search Results

Search: id:A101678

Displaying 1-1 of 1 results found.

page 1

A modular binomial transform of 10^n.

+0
2

1, -1, 9, 1, 89, -99, 991, -1, 9909, -9899, 88991, 9999, 899911, -999901, 9999009, 1, 99990089, -99990099, 899910991, 99989999, 8899099911, -9898999901, 99089999009, -99999999, 990999990091, -989999990101, 8899999911009, 999999990001, 89999999100089, -99999999000099 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`a(2^n-1)=(-1)^n.`
	FORMULA	`a(n)=sum{k=0..floor(n/2), (-1)^A010060(n-2k)*mod(binomial(n-k, k), 2)10^k}`
	CROSSREFS	`Cf. A101679.` `Sequence in context: A038291 A075504 A138342 this_sequence A051380 A136238 A113394` `Adjacent sequences: A101675 A101676 A101677 this_sequence A101679 A101680 A101681`
	KEYWORD	`easy,sign`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Dec 11 2004`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research