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!)
A100737 Inverse modulo 2 binomial transform of 4^n. 0
1, 3, 15, 45, 255, 765, 3825, 11475, 65535, 196605, 983025, 2949075, 16711425, 50134275, 250671375, 752014125, 4294967295, 12884901885, 64424509425, 193273528275, 1095216660225, 3285649980675, 16428249903375, 49284749710125 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
4^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)4^k}.
CROSSREFS
Sequence in context: A260021 A005560 A100747 * A178669 A110464 A261505
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Dec 06 2004
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 April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)