|
%I #56 Dec 31 2023 11:29:23
%S 1,5,16,53,175,578,1909,6305,20824,68777,227155,750242,2477881,
%T 8183885,27029536,89272493,294847015,973813538,3216287629,10622676425,
%U 35084316904,115875627137,382711198315,1264009222082,4174738864561,13788225815765,45539416311856
%N a(n+2) = 3*a(n+1) + a(n), with a(0) = 1, a(1) = 5.
%C Binomial transform is A109114.
%C Invert transform is A109115.
%C Inverse invert transform is A016777.
%C Inverse binomial transform is A006130.
%H Andrew Howroyd, <a href="/A108300/b108300.txt">Table of n, a(n) for n = 0..1000</a>
%H Sergio Falcon, <a href="https://doi.org/10.1016/j.chaos.2016.03.038">The k-Fibonacci difference sequences</a>, Chaos, Solitons & Fractals, Volume 87, June 2016, Pages 153-157.
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H Vincent Vatter, <a href="https://arxiv.org/abs/1605.04297">Growth rates of permutation classes: from countable to uncountable</a>, arXiv:1605.04297 [math.CO], 2016. (Mentions a signed version.)
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,1).
%F G.f.: (1 + 2*x)/(1 - 3*x - x^2).
%F a(n) = A052924(n+1) - A052924(n).
%F a(n)*a(n-2) = a(n-1)^2 + 9*(-1)^n. - _Roger L. Bagula_, May 17 2010
%p seriestolist(series((-2*x-1)/(x^2-1+3*x), x=0,25));
%t LinearRecurrence[{3,1},{1,5},40] (* _Harvey P. Dale_, Jul 04 2013 *)
%o (PARI) Vec((1 + 2*x)/(1 - 3*x - x^2) + O(x^30)) \\ _Andrew Howroyd_, Jun 05 2021
%Y Row sums and main diagonal of A143972. - _Gary W. Adamson_, Sep 06 2008
%Y Cf. A109114, A109115, A016777, A006130, A000004, A052924, A228916.
%K nonn,easy
%O 0,2
%A _Creighton Dement_, Jul 24 2005
|
