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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100735 Inverse modulo 2 binomial transform of 2^n. 3
1, 1, 3, 3, 15, 15, 45, 45, 255, 255, 765, 765, 3825, 3825, 11475, 11475, 65535, 65535, 196605, 196605, 983025, 983025, 2949075, 2949075, 16711425, 16711425, 50134275, 50134275, 250671375, 250671375, 752014125, 752014125, 4294967295, 4294967295 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

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

FORMULA

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

CROSSREFS

Sequence in context: A160612 A172087 A086116 * A129356 A185275 A055634

Adjacent sequences:  A100732 A100733 A100734 * A100736 A100737 A100738

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 06 2004

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

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

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.