The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A100744 Inverse modulo 2 binomial transform of (-2)^n. 0
1, -3, 3, -9, 15, -45, 45, -135, 255, -765, 765, -2295, 3825, -11475, 11475, -34425, 65535, -196605, 196605, -589815, 983025, -2949075, 2949075, -8847225, 16711425, -50134275, 50134275, -150402825, 250671375, -752014125, 752014125 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
(-2)^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)*a(k)}.
LINKS
FORMULA
a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)(-2)^k}.
CROSSREFS
Sequence in context: A147471 A062510 A000200 * A331519 A285883 A232948
KEYWORD
easy,sign
AUTHOR
Paul Barry, Dec 06 2004
EXTENSIONS
Definition 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 May 24 23:50 EDT 2024. Contains 372782 sequences. (Running on oeis4.)