|
%I #7 Aug 27 2021 21:05:26
%S 0,-1,2,1,9,10,31,41,96,137,281,418,795,1213,2200,3413,5997,9410,
%T 16175,25585,43296,68881,115249,184130,305523,489653,807464,1297117,
%U 2129157,3426274,5604583,9030857,14733744,23764601,38694953,62459554,101547723,164007277
%N a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = -1, a(2) = 2, a(3) = 1.
%C a(n)/a(n-1) -> (1 + sqrt(5))/2 = golden ratio (A001622), so that a( ) has the growth rate of the Fibonacci numbers (A000045).
%H Clark Kimberling, <a href="/A295851/b295851.txt">Table of n, a(n) for n = 0..2000</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1, 3, -2, -2)
%F a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = -1, a(2) = 2, a(3) = 1.
%F G.f.: (-x + 3 x^2 + 2 x^3)/(1 - x - 3 x^2 + 2 x^3 + 2 x^4).
%t LinearRecurrence[{1, 3, -2, -2}, {0, -1, 2, 1}, 100]
%Y Cf. A001622, A000045.
%K easy,sign
%O 0,3
%A _Clark Kimberling_, Dec 01 2017
|
