Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106434
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106434 The (1,1)-entry of the matrix A^n, where A = [0,1;2,3]. +0
1
0, 2, 6, 22, 78, 278, 990, 3526, 12558, 44726, 159294, 567334, 2020590, 7196438, 25630494, 91284358, 325114062, 1157910902, 4123960830, 14687704294, 52311034542, 186308512214, 663547605726, 2363259841606, 8416874736270 (list; graph; listen)
OFFSET

1,2

COMMENT

The characteristic polynomial of the matrix A is x^2-3x-2.

The first entry of the vector v[n]=Av[n-1], where A is the 2 X 2 matrix [[0,2],[1,3]] and v[1] is the column vector [0,1].

FORMULA

Recurrence relation: a(n)=3a(n-1)+2a(n-2) for n>=3; a(1)=0, a(2)=2.

O.g.f.: -2*x^2/(-1+3*x+2*x^2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 05 2007

a(n)=-(2/17)*sqrt(17)*[3/2-(1/2)*sqrt(17)]^n+(2/17)*[3/2+(1/2)*sqrt(17)]^n*sqrt(17), with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 12 2008

MAPLE

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

MATHEMATICA

M = {{0, 2}, {1, 3}} v[1] = {0, 1} v[n_] := v[n] = M.v[n - 1] a = Table[Abs[v[n][[1]]], {n, 1, 50}]

PROGRAM

(PARI) A106434(n)=([0, 1; 2, 3]^n)[1, 1] /* M. F. Hasler, Dec 01 2008 */

CROSSREFS

Cf. A028860, A100638.

Equals 2*A007482(n-2), for n>1.

Sequence in context: A014334 A107239 A148496 this_sequence A150228 A072547 A150229

Adjacent sequences: A106431 A106432 A106433 this_sequence A106435 A106436 A106437

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 29 2005

EXTENSIONS

Simplified definition, added PARI code and cross reference. - M. F. Hasler (MHasler(AT)univ-ag.fr), Dec 01 2008

Edited by N. J. A. Sloane (njas(AT)research.att.com), May 20 2006 and Dec 04 2008

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research