login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108152 a(n)= 3*a(n-1) +2*a(n-2) +a(n-3). 0
1, 0, 2, 7, 25, 91, 330, 1197, 4342, 15750, 57131, 207235, 751717, 2726752, 9890925, 35877996, 130142590, 472074687, 1712387237, 6211453675, 22531210186, 81728925145, 296460649482, 1075371008922, 3900763250875, 14149492419951 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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

FORMULA

G.f.: (-1+3*x)/(-1+3*x+2*x^2+x^3). [Sep 28 2009]

a(n) = A108153(n+1) -3*A108153(n). [Sep 28 2009]

MATHEMATICA

M = {{0, 1, 0}, {0, 0, 1}, {1, 2, 3}} a3 = Table[MatrixPower[M, i][[1, 2]], {i, 1, 50}]

LinearRecurrence[{3, 2, 1}, {1, 0, 2}, 30] (* Harvey P. Dale, Jun 06 2016 *)

CROSSREFS

Cf. A000073, A001590.

Sequence in context: A048576 A018907 A052936 * A024482 A097613 A074605

Adjacent sequences: A108149 A108150 A108151 * A108153 A108154 A108155

KEYWORD

nonn,easy

AUTHOR

Roger L. Bagula, Jun 06 2005

EXTENSIONS

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

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 07:38 EST 2022. Contains 358691 sequences. (Running on oeis4.)