Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100738
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A100738
%S A100738 1,4,24,96,624,2496,14976,59904,390624,1562496,9374976,37499904,
%T A100738 243749376,974997504,5849985024,23399940096,152587890624,610351562496,
%U A100738 3662109374976,14648437499904,95214843749376,380859374997504
%N A100738 Inverse modulo 2 binomial transform of 5^n.
%C A100738 5^n may be retrieved as sum{k=0..n, mod(binomial(n,k),2)A100738(k)}.
%F A100738 a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)5^k}.
%Y A100738 Sequence in context: A100381 A091143 A119920 this_sequence A139238 A139231 
               A052462
%Y A100738 Adjacent sequences: A100735 A100736 A100737 this_sequence A100739 A100740 
               A100741
%K A100738 easy,nonn
%O A100738 0,2
%A A100738 Paul Barry (pbarry(AT)wit.ie), Dec 06 2004

    
page 1

Search completed in 0.001 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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research