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

2, 1, 1, 1, 4, 6, 8, 13, 23, 37, 58, 94, 154, 249, 401, 649, 1052, 1702, 2752, 4453, 7207, 11661, 18866, 30526, 49394, 79921, 129313, 209233, 338548, 547782, 886328, 1434109, 2320439, 3754549, 6074986, 9829534, 15904522, 25734057, 41638577, 67372633

Offset

0,1

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, 0, 1, 1)

Formula

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

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

Mathematica

LinearRecurrence[{1, 0, 1, 1}, {2, 1, 1, 1}, 100]

Crossrefs

Cf. A001622, A000045.

Sequence in context: A362827 A342413 A202019 * A330942 A141471 A331572

Adjacent sequences: A295682 A295683 A295684 * A295686 A295687 A295688

Keyword

nonn,easy

Author

Clark Kimberling, Nov 29 2017

Status

approved