login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100744 Inverse modulo 2 binomial transform of (-2)^n. 0

%I

%S 1,-3,3,-9,15,-45,45,-135,255,-765,765,-2295,3825,-11475,11475,-34425,

%T 65535,-196605,196605,-589815,983025,-2949075,2949075,-8847225,

%U 16711425,-50134275,50134275,-150402825,250671375,-752014125,752014125

%N Inverse modulo 2 binomial transform of (-2)^n.

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

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

%K easy,sign

%O 0,2

%A _Paul Barry_, Dec 06 2004

%E Definition corrected by _N. J. A. Sloane_, Dec 20 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 23:48 EDT 2021. Contains 343652 sequences. (Running on oeis4.)