Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101554
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101554 Second inverse mod 2 binomial transform of 2^n. +0
1
1, 2, 14, 28, 254, 508, 3556, 7112, 65534, 131068, 917476, 1834952, 16645636, 33291272, 233038904, 466077808, 4294967294, 8589934588, 60129542116, 120259084232, 1090921692676, 2181843385352, 15272903697464, 30545807394928 (list; graph; listen)
OFFSET

0,2

COMMENT

Interpolated zeros suppressed.

FORMULA

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

CROSSREFS

Adjacent sequences: A101551 A101552 A101553 this_sequence A101555 A101556 A101557

Sequence in context: A072390 A117705 A031079 this_sequence A057018 A038341 A075718

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research