|
%I #12 Sep 08 2022 08:45:50
%S 0,0,1,6,17,42,93,198,409,834,1685,3390,6801,13626,27277,54582,109193,
%T 218418,436869,873774,1747585,3495210,6990461,13980966,27961977,
%U 55924002,111848053,223696158,447392369,894784794,1789569645,3579139350,7158278761,14316557586
%N a(n) = (5*2^(n+1)-9-(-1)^n)/6-2*n.
%H Vincenzo Librandi, <a href="/A171507/b171507.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3, -1, -3, 2).
%F a(n) = 3*a(n-1)-a(n-2)-3*a(n-3)+2*a(n-4). G.f.: x^2*(1+3*x)/((1+x)*(1-2*x)*(1-x)^2).
%F a(n) = A084640(n) - A042948(n).
%F a(n+1)-2*a(n) = A042948(n+1).
%F First differences: a(n+1)-a(n) = A084640(n).
%F Last digits: a(n) == a(n+10) (mod 10), n>=1.
%p A171507:=n->(5*2^(n+1)-9-(-1)^n)/6 -2*n: seq(A171507(n), n=0..50); # _Wesley Ivan Hurt_, May 03 2017
%o (Magma) [(5*2^(n+1)-9-(-1)^n)/6 -2*n: n in [0..40]]; // _Vincenzo Librandi_, Aug 05 2011
%Y Cf. A042948, A084640.
%K nonn,easy
%O 0,4
%A _Paul Curtz_, Dec 10 2009
%E Edited and extended by _R. J. Mathar_, Dec 15 2009
|
