Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100472
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100472 Inverse modulo 2 modulo transform of 9^n. +0
1
1, 8, 80, 640, 6560, 52480, 524800, 4198400, 43046720, 344373760, 3443737600, 27549900800, 282386483200, 2259091865600, 22590918656000, 180727349248000, 1853020188851840, 14824161510814720, 148241615108147200 (list; graph; listen)
OFFSET

0,2

COMMENT

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

FORMULA

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

CROSSREFS

Sequence in context: A100431 A102698 A055346 this_sequence A043035 A024101 A136949

Adjacent sequences: A100469 A100470 A100471 this_sequence A100473 A100474 A100475

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research