# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a145766
Showing 1-1 of 1

%I A145766 #27 Oct 18 2022 03:29:28
%S A145766 0,2,12,54,224,906,3636,14558,58248,233010,932060,3728262,14913072,
%T A145766 59652314,238609284,954437166,3817748696,15270994818,61083979308,
%U A145766 244335917270,977343669120,3909374676522,15637498706132,62549994824574
%N A145766 Partial sums of A020988.
%H A145766 Vincenzo Librandi, <a href="/A145766/b145766.txt">Table of n, a(n) for n = 0..1000</a>
%H A145766 Hacène Belbachir and El-Mehdi Mehiri, <a href="https://arxiv.org/abs/2210.08657">Enumerating moves in the optimal solution of the Tower of Hanoi</a>, arXiv:2210.08657 [math.CO], 2022.
%H A145766 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,-9,4).
%F A145766 a(n) = Sum_{i=0..n} A020988(i). a(n+1)-a(n)=A020988(n+1).
%F A145766 a(n) = 2*(4^(n+1)-3n-4)/9 = 2*A014825(n). - _R. J. Mathar_, Oct 21 2008
%F A145766 G.f.: 2*x/((1-x)^2*(1-4*x)). [_Colin Barker_, Jan 11 2012]
%F A145766 a(n) = 6*a(n-1)-9*a(n-2)+4*a(n-3), for n>2, with {a(k)}={0,2,12}, k=0,1,2. - _L. Edson Jeffery_, Mar 01 2012
%t A145766 lst={}; s=0; Do[s+=(s+=n+s); AppendTo[lst,s],{n,0,5!}]; lst
%t A145766 Accumulate[LinearRecurrence[{5,-4},{0,2},30]] (* or *) LinearRecurrence[ {6,-9,4},{0,2,12},30] (* _Harvey P. Dale_, Sep 25 2013 *)
%Y A145766 Cf. A014825, A020988.
%K A145766 nonn
%O A145766 0,2
%A A145766 _Vladimir Joseph Stephan Orlovsky_, Oct 18 2008
%E A145766 Edited by _R. J. Mathar_, Oct 21 2008

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE