login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100681 Inverse modulo 2 binomial transform of 10^n. 0
1, 9, 99, 891, 9999, 89991, 989901, 8909109, 99999999, 899999991, 9899999901, 89099999109, 999899990001, 8999099910009, 98990099010099, 890910891090891, 9999999999999999, 89999999999999991, 989999999999999901 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

10^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)*a(k)}.

LINKS

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

FORMULA

a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)10^k}.

CROSSREFS

Sequence in context: A116286 A306449 A160946 * A043044 A222729 A069000

Adjacent sequences:  A100678 A100679 A100680 * A100682 A100683 A100684

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Dec 06 2004

EXTENSIONS

Definition and comment corrected by N. J. A. Sloane, Dec 20 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 15:37 EDT 2022. Contains 355994 sequences. (Running on oeis4.)