|
%I #38 Feb 10 2024 11:34:50
%S 1,15,198,2578,33519,435753,5664796,73642356,957350637,12445558291,
%T 161792257794,2103299351334,27342891567355,355457590375629,
%U 4620948674883192,60072332773481512,780940326055259673,10152224238718375767,131978915103338884990
%N a(1) = 1, a(n) = 13*a(n-1) + n.
%H Vincenzo Librandi, <a href="/A014896/b014896.txt">Table of n, a(n) for n = 1..200</a>
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (15,-27,13).
%F a(n) = 15*a(n-1)-27*a(n-2)+13*a(n-3), with a(1)=1, a(2)=15, a(3)=198. - _Vincenzo Librandi_, Oct 20 2012
%F G.f.: x/((1-13*x)*(1-x)^2). - _Jinyuan Wang_, Mar 11 2020
%p a:=n->sum((13^(n-j)-1)/12,j=0..n): seq(a(n), n=1..17); # _Zerinvary Lajos_, Jan 05 2007
%p a:= n-> (Matrix([[1,0,1],[1,1,1],[0,0,13]])^n)[2,3]:
%p seq(a(n), n=1..17); # _Alois P. Heinz_, Aug 06 2008
%t LinearRecurrence[{15, -27, 13}, {1, 15, 198}, 20] (* _Vincenzo Librandi_, Oct 20 2012 *)
%o (Magma) I:=[1, 15, 198]; [n le 3 select I[n] else 15*Self(n-1) - 27*Self(n-2)+ 13*Self(n-3): n in [1..20]]; // _Vincenzo Librandi_, Oct 20 2012
%o (Maxima)
%o a[1]:1$
%o a[2]:15$
%o a[3]:198$
%o a[n]:=15*a[n-1]-27*a[n-2]+13*a[n-3]$
%o A014896(n):=a[n]$ makelist(A014896(n),n,1,30); /* _Martin Ettl_, Nov 07 2012 */
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_, _Olivier Gérard_
|
