|
%I #28 Mar 18 2024 09:51:12
%S 1,2,7,26,95,345,1252,4544,16493,59864,217286,788674,2862617,10390321,
%T 37713313,136886433,496850954,1803399103,6545722210,23758733815,
%U 86236081273,313007493212,1136110191472,4123691589365,14967590689568
%N Sequence is its own 4th difference.
%C Row sums of Riordan array (1/(1-x), x/(1-x)^4), A109960. - _Paul Barry_, Jul 06 2005
%H Vincenzo Librandi, <a href="/A055988/b055988.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (5,-6,4,-1).
%F a(n) = 5a(n-1) - 6a(n-2) + 4a(n-3) - a(n-4) = a(n-1) + A055991(n-1) = A055989(n) - A055989(n-1) = A055990(n) - 2*A055990(n-1) + A055990(n-2).
%F From _Paul Barry_, Jul 06 2005: (Start)
%F G.f.: (1-x)^3/(1 - 5x + 6x^2 - 4x^3 + x^4);
%F a(n) = Sum_{k=0..n} binomial(n+3k, 4k). (End)
%t CoefficientList[Series[(1-x)^3/(1-5x+6x^2-4x^3+x^4),{x,0,40}],x] (* _Vincenzo Librandi_, Apr 05 2012 *)
%t LinearRecurrence[{5,-6,4,-1},{1,2,7,26},30] (* _Harvey P. Dale_, Jan 15 2017 *)
%o (Magma) I:=[1, 2, 7, 26]; [n le 4 select I[n] else 5*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..30]]; // _Vincenzo Librandi_, Apr 05 2012
%Y Cf. A055989, A055990, A055991 for the other differences of a(n). See A000079, A001906, A052529 for examples of sequences which are respectively their own first, second and third differences.
%K nonn,easy
%O 1,2
%A _Henry Bottomley_, Jun 02 2000
%E More terms from _James A. Sellers_, Jun 05 2000
|
