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
A100738 Inverse modulo 2 binomial transform of 5^n. +0
1
1, 4, 24, 96, 624, 2496, 14976, 59904, 390624, 1562496, 9374976, 37499904, 243749376, 974997504, 5849985024, 23399940096, 152587890624, 610351562496, 3662109374976, 14648437499904, 95214843749376, 380859374997504 (list; graph; listen)
OFFSET

0,2

COMMENT

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

FORMULA

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

CROSSREFS

Sequence in context: A100381 A091143 A119920 this_sequence A139238 A139231 A052462

Adjacent sequences: A100735 A100736 A100737 this_sequence A100739 A100740 A100741

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research