A295718 a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 1, a(1) = 3, a(2) = 4, a(3) = 5.

1, 3, 4, 5, 9, 10, 19, 21, 40, 45, 85, 98, 183, 217, 400, 489, 889, 1122, 2011, 2621, 4632, 6229, 10861, 15042, 25903, 36849, 62752, 91409, 154161, 229186, 383347, 579765, 963112, 1477341, 2440453, 3786722, 6227175, 9751753, 15978928, 25206393, 41185321

Offset

0,2

Comments

a(n)/a(n-1) -> (1 + sqrt(5))/2 = golden ratio (A001622), so that a( ) has the growth rate of the Fibonacci numbers (A000045).

Links

Clark Kimberling, Table of n, a(n) for n = 0..2000

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

Formula

a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 3, a(2) = 4, a(3) = 5.

G.f.: (1 + 2 x - 2 x^2 - 6 x^3)/(1 - x - 3 x^2 + 2 x^3 + 2 x^4).

Mathematica

LinearRecurrence[{1, 3, -2, -2}, {1, 3, 4, 5}, 100]

Crossrefs

Cf. A001622, A000045, A005672.

Sequence in context: A190211 A136120 A217040 * A035236 A047600 A325464

Adjacent sequences: A295715 A295716 A295717 * A295719 A295720 A295721

Keyword

nonn,easy

Author

Clark Kimberling, Nov 29 2017

Status

approved