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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100736 Inverse modulo 2 binomial transform of 3^n. 1
1, 2, 8, 16, 80, 160, 640, 1280, 6560, 13120, 52480, 104960, 524800, 1049600, 4198400, 8396800, 43046720, 86093440, 344373760, 688747520, 3443737600, 6887475200, 27549900800, 55099801600, 282386483200, 564772966400 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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

FORMULA

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

CROSSREFS

Sequence in context: A094014 A098232 A195798 * A099888 A199043 A046161

Adjacent sequences:  A100733 A100734 A100735 * A100737 A100738 A100739

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 15 14:37 EST 2012. Contains 205822 sequences.