Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100744
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100744 Inverse modulo 2 modulo transform of (-2)^n. +0
1
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; listen)
OFFSET

0,2

COMMENT

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

FORMULA

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

CROSSREFS

Adjacent sequences: A100741 A100742 A100743 this_sequence A100745 A100746 A100747

Sequence in context: A105423 A062510 A000200 this_sequence A089892 A038221 A099465

KEYWORD

easy,sign

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research