login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101678 A modular binomial transform of 10^n. 1
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; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(2^n-1)=(-1)^n.

LINKS

Table of n, a(n) for n=0..29.

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 * A051380 A136238 A113394

Adjacent sequences:  A101675 A101676 A101677 * A101679 A101680 A101681

KEYWORD

easy,sign

AUTHOR

Paul Barry, Dec 11 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

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

Last modified July 22 09:30 EDT 2014. Contains 244804 sequences.