Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100740
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100740 Inverse modulo 2 binomial transform of 7^n. +0
1
1, 6, 48, 288, 2400, 14400, 115200, 691200, 5764800, 34588800, 276710400, 1660262400, 13835520000, 83013120000, 664104960000, 3984629760000, 33232930569600, 199397583417600, 1595180667340800, 9571084004044800 (list; graph; listen)
OFFSET

0,2

COMMENT

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

FORMULA

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

CROSSREFS

Sequence in context: A052771 A056289 A056284 this_sequence A043020 A073994 A165758

Adjacent sequences: A100737 A100738 A100739 this_sequence A100741 A100742 A100743

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research