This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122365 The (1,6)-entry of the matrix M^n, where M is the 6 X 6 matrix {{1, 1, 1, 1, 1, 1},{1, 0, 0, 0, 1, 0},{1, 0, 0, 1, 0, 0},{1, 0, 1, 0, 0, 0},{1, 1, 0, 0, 0, 0}, {1, 0, 0, 0, 0, 0}}. 1
 0, 1, 1, 6, 15, 53, 160, 517, 1621, 5150, 16267, 51513, 162944, 515673, 1631609, 5162966, 16336695, 51693645, 163571104, 517580093, 1637750957, 5182251182, 16397926099, 51887105969, 164183665152, 519517828081, 1643883210801, 5201654068774, 16459323152671 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Colin Barker, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (2,4,-1). FORMULA a(n) = 2*a(n-1) + 5*a(n-2) - 3*a(n-3) - 4*a(n-4) + a(n-5); a(0)=0, a(1)=1, a(2)=1,a(3)=6,a(4)=15 (follows from the minimal polynomial of M). From Colin Barker, Mar 03 2017: (Start) G.f.: x*(1 - x) / (1 - 2*x - 4*x^2 + x^3). a(n) = 2*a(n-1) + 4*a(n-2) - a(n-3) for n>2. (End) MAPLE a[0]:=0: a[1]:=1: a[2]:=1: a[3]:=6: a[4]:=15: for n from 5 to 26 do a[n]:=2*a[n-1]+5*a[n-2]-3*a[n-3]-4*a[n-4]+a[n-5] od: seq(a[n], n=0..26); MATHEMATICA M = {{1, 1, 1, 1, 1, 1}, {1, 0, 0, 0, 1, 0}, {1, 0, 0, 1, 0, 0}, {1, 0, 1, 0, 0, 0}, {1, 1, 0, 0, 0, 0}, {1, 0, 0, 0, 0, 0}}; v[1] = {0, 0, 0, 0, 0, 1}; v[n_] := v[n] = M.v[n - 1]; a1 = Table[v[n][[1]], {n, 1, 50}] PROG (PARI) concat(0, Vec(x*(1 - x) / (1 - 2*x - 4*x^2 + x^3) + O(x^40))) \\ Colin Barker, Mar 03 2017 CROSSREFS Sequence in context: A056347 A271332 A244024 * A262912 A119132 A073065 Adjacent sequences:  A122362 A122363 A122364 * A122366 A122367 A122368 KEYWORD nonn,easy AUTHOR Gary W. Adamson and Roger L. Bagula, Oct 19 2006 EXTENSIONS Edited by N. J. A. Sloane, Oct 29 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 16 17:39 EST 2018. Contains 317275 sequences. (Running on oeis4.)