|
%I #22 Sep 08 2022 08:46:09
%S 0,64,576,4672,37440,299584,2396736,19173952,153391680,1227133504,
%T 9817068096,78536544832,628292358720,5026338869824,40210710958656,
%U 321685687669312,2573485501354560,20587884010836544,164703072086692416,1317624576693539392
%N a(n) = Sum_{k=2..n} 8^k.
%H Vincenzo Librandi, <a href="/A247841/b247841.txt">Table of n, a(n) for n = 1..200</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (9,-8).
%F G.f.: 64*x^2/((1-x)*(1-8*x)).
%F a(n) = a(n-1) + 8^n.
%F a(n) = (8^(n+1) - 64)/7.
%F a(n) = 9*a(n-1) - 8*a(n-2).
%F a(n) = A052379(n) - 8. - _Michel Marcus_, Sep 25 2014
%t RecurrenceTable[{a[1] == 0, a[n] == a[n-1] + 8^n}, a, {n, 30}] (* or *) CoefficientList[Series[64 x / ((1 - x) (1 - 8 x)), {x, 0, 30}], x]
%t LinearRecurrence[{9,-8},{0,64},30] (* _Harvey P. Dale_, May 01 2018 *)
%o (Magma) [0] cat [&+[8^k: k in [2..n]]: n in [2..30]]; /* or */ [(8^(n+1)-64)/7: n in [1..30]];
%Y Cf. similar sequences listed in A247817.
%Y Cf. A052379.
%K nonn,easy
%O 1,2
%A _Vincenzo Librandi_, Sep 25 2014
|
