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

2, 1, 0, 2, 5, 6, 8, 15, 26, 40, 63, 104, 170, 273, 440, 714, 1157, 1870, 3024, 4895, 7922, 12816, 20735, 33552, 54290, 87841, 142128, 229970, 372101, 602070, 974168, 1576239, 2550410, 4126648, 6677055, 10803704, 17480762, 28284465, 45765224, 74049690

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) = 0, a(3) = 1.

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

Mathematica

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

Crossrefs

Cf. A001622, A000045.

Sequence in context: A074142 A059084 A246117 * A355610 A355609 A266994

Adjacent sequences: A295685 A295686 A295687 * A295689 A295690 A295691

Keyword

nonn,easy

Author

Clark Kimberling, Nov 29 2017

Status

approved