Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087462
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087462 Generalized mod 3 multiplicative Jacobsthal sequence. +0
3
1, 1, 1, 8, 5, 11, 64, 43, 85, 512, 341, 683, 4096, 2731, 5461, 32768, 21845, 43691, 262144, 174763, 349525, 2097152, 1398101, 2796203, 16777216, 11184811, 22369621, 134217728, 89478485, 178956971, 1073741824, 715827883, 1431655765 (list; graph; listen)
OFFSET

0,4

COMMENT

2^n=A087462(n)+A087463(n)+A087464(n) provides a decomposition of Pascal's triangle. Multiplicative analogue of A078008.

FORMULA

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

CROSSREFS

Cf. A001045.

Sequence in context: A132717 A070473 A154210 this_sequence A070484 A096480 A038283

Adjacent sequences: A087459 A087460 A087461 this_sequence A087463 A087464 A087465

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research