Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100736
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A100736
%S A100736 1,2,8,16,80,160,640,1280,6560,13120,52480,104960,524800,1049600,
%T A100736 4198400,8396800,43046720,86093440,344373760,688747520,3443737600,
%U A100736 6887475200,27549900800,55099801600,282386483200,564772966400
%N A100736 Inverse modulo 2 binomial transform of 3^n.
%C A100736 3^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)A100736(k)}.
%F A100736 a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)3^k}.
%Y A100736 Sequence in context: A096195 A094014 A098232 this_sequence A099888 A046161 
               A092978
%Y A100736 Adjacent sequences: A100733 A100734 A100735 this_sequence A100737 A100738 
               A100739
%K A100736 easy,nonn
%O A100736 0,2
%A A100736 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research