Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

COMMENT

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

FORMULA

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

CROSSREFS

Sequence in context: A074355 A005560 A100747 this_sequence A110464 A088108 A163383

Adjacent sequences: A100734 A100735 A100736 this_sequence A100738 A100739 A100740

KEYWORD

easy,nonn

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 November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research