|
%I #14 Oct 18 2022 15:28:04
%S 0,0,0,0,1,9,27,64,129,232,387,609,913,1320,1848,2520,3360,4393,5649,
%T 7155,8944,11049,13504,16347,19617,23353,27600,32400,37800,43848,
%U 50593,58089,66387,75544,85617,96664
%N [ n(n-1)(n-2)(n-3)/13 ].
%H <a href="/index/Rec#order_17">Index entries for linear recurrences with constant coefficients</a>, signature (4, -6, 4, -1, 0, 0, 0, 0, 0, 0, 0, 0, 1, -4, 6, -4, 1).
%F From _Chai Wah Wu_, Aug 02 2020: (Start)
%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) + a(n-13) - 4*a(n-14) + 6*a(n-15) - 4*a(n-16) + a(n-17) for n > 16.
%F G.f.: x^4*(-x^12 - 5*x^11 + 3*x^10 - 6*x^9 - x^7 - 4*x^6 - x^5 - 6*x^3 + 3*x^2 - 5*x - 1)/(x^17 - 4*x^16 + 6*x^15 - 4*x^14 + x^13 - x^4 + 4*x^3 - 6*x^2 + 4*x - 1). (End)
%o (PARI) a(n)=n*(n-1)*(n-2)*(n-3)\13 \\ _Charles R Greathouse IV_, Oct 18 2022
%K nonn,easy
%O 0,6
%A _N. J. A. Sloane_.
|
