Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087463
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087463 Generalized multiplicative Jacobsthal sequence. +0
3
0, 1, 1, 0, 5, 11, 0, 43, 85, 0, 341, 683, 0, 2731, 5461, 0, 21845, 43691, 0, 174763, 349525, 0, 1398101, 2796203, 0, 11184811, 22369621, 0, 89478485, 178956971, 0, 715827883, 1431655765, 0, 5726623061, 11453246123, 0, 45812984491 (list; graph; listen)
OFFSET

0,5

COMMENT

Set A001045(3n)=0 in A001045. 2^n=A087462(n)+A087463(n)+A087464(n) provides a decomposition of Pascal's triangle.

FORMULA

a(n)=sum{k=0..n, if (mod(nk, 3)=1, 1, 0)C(n, k)}; a(n)=(2/9)(1-cos(2pi*n/3))(2^n-(-1)^n).

CROSSREFS

Sequence in context: A119137 A048360 A067958 this_sequence A160366 A160923 A111118

Adjacent sequences: A087460 A087461 A087462 this_sequence A087464 A087465 A087466

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Sep 08 2003

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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research