Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122788
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122788 (1,3)-entry of the 3 X 3 matrix M^n, where M={{0, -1, 1}, {1, 1, 0}, {0, 1, 1}}. +0
1
0, 1, 1, 0, 0, 2, 4, 4, 4, 8, 16, 24, 32, 48, 80, 128, 192, 288, 448, 704, 1088, 1664, 2560, 3968, 6144, 9472, 14592, 22528, 34816, 53760, 82944, 128000, 197632, 305152, 471040, 727040, 1122304, 1732608, 2674688, 4128768, 6373376, 9838592, 15187968 (list; graph; listen)
OFFSET

0,6

FORMULA

Rec. rel: a(n)=2a(n-1)-2a(n-2)+2a(n-3) (follows from the minimal polynomial of the matrix M).

a(n)=A078003(n-1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 02 2008]

EXAMPLE

a(7)=4 because M^7 ={{0,4,4},{4,4,8},{8,12,12}}.

MAPLE

with(linalg): M[1]:=matrix(3, 3, [0, -1, 1, 1, 1, 0, 0, 1, 1]): for n from 2 to 42 do M[n]:=multiply(M[1], M[n-1]) od: 0, seq(M[n][1, 3], n=1..42);

a[0]:=0: a[1]:=1: a[2]:=1: for n from 3 to 42 do a[n]:=2*a[n-1]-2*a[n-2]+2*a[n-3] od: seq(a[n], n=0..42);

MATHEMATICA

M = {{0, -1, 1}, {1, 1, 0}, {0, 1, 1}}; v[1] = {0, 0, 1}; v[n_] := v[n] = M.v[n - 1]; a1 = Table[v[n][[1]], {n, 1, 50}]

CROSSREFS

Sequence in context: A076345 A160809 A139251 this_sequence A078003 A081524 A021413

Adjacent sequences: A122785 A122786 A122787 this_sequence A122789 A122790 A122791

KEYWORD

nonn

AUTHOR

Gary Adamson and Roger Bagula (rlbagulatftn(AT)yahoo.com), Oct 20 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 24 2006

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 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research