Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100739
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100739 Inverse modulo 2 binomial transform of 6^n. +0
1
1, 5, 35, 175, 1295, 6475, 45325, 226625, 1679615, 8398075, 58786525, 293932625, 2175101425, 10875507125, 76128549875, 380642749375, 2821109907455, 14105549537275, 98738846760925, 493694233804625, 3653337330154225 (list; graph; listen)
OFFSET

0,2

COMMENT

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

FORMULA

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

CROSSREFS

Sequence in context: A124793 A048515 A085503 this_sequence A043014 A165755 A166149

Adjacent sequences: A100736 A100737 A100738 this_sequence A100740 A100741 A100742

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research