A108153 a(n) = 3*a(n-1) + 2*a(n-2) + a(n-3).

0, 1, 3, 11, 40, 145, 526, 1908, 6921, 25105, 91065, 330326, 1198213, 4346356, 15765820, 57188385, 207443151, 752472043, 2729490816, 9900859685, 35914032730, 130273308376, 472548850273, 1714107200301, 6217692609825, 22553841080350, 81811015661001

Offset

0,3

Links

Table of n, a(n) for n=0..26.

Index entries for linear recurrences with constant coefficients, signature (3,2,1).

Formula

G.f.: x/(1-3*x-2*x^2-x^3). [R. J. Mathar, Mar 19 2009]

a(n) = 11*a(n-2) +7*a(n-3)+3*a(n-4). [Gary Detlefs, Sep 13 2010]

Mathematica

M = {{0, 1, 0}, {0, 0, 1}, {1, 2, 3}} a3 = Table[MatrixPower[M, i][[1, 3]], {i, 1, 50}]
LinearRecurrence[{3, 2, 1}, {0, 1, 3}, 40] (* Vladimir Joseph Stephan Orlovsky, Jan 31 2012 *)

Crossrefs

Cf. A000073, A001590. Essentially the same as A010911.

Sequence in context: A066979 A333548 A136775 * A010911 A052941 A296221

Adjacent sequences: A108150 A108151 A108152 * A108154 A108155 A108156

Keyword

nonn,easy

Author

Roger L. Bagula, Jun 06 2005

Extensions

Definition replaced by the Adamson recurrence - the Associate Editors of the OEIS, Sep 28 2009

Status

approved