login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048501 a(n) = 2^(n-1)*(8*n-14)+8. 1

%I #19 Sep 08 2022 08:44:57

%S 1,2,12,48,152,424,1096,2696,6408,14856,33800,75784,167944,368648,

%T 802824,1736712,3735560,7995400,17039368,36175880,76546056,161480712,

%U 339738632,713031688,1493172232,3120562184,6509559816,13555990536,28185722888,58518929416

%N a(n) = 2^(n-1)*(8*n-14)+8.

%C a(n) = T(7, n), array T given by A048494.

%H Vincenzo Librandi, <a href="/A048501/b048501.txt">Table of n, a(n) for n = 0..2000</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (5,-8,4).

%F G.f.: (1-3*x+10*x^2) / ((1-x)*(1-2*x)^2). - _Colin Barker_, Aug 24 2016

%t Table[2^(n-1) (8n-14)+8,{n,0,30}] (* or *) LinearRecurrence[{5,-8,4},{1,2,12},30] (* _Harvey P. Dale_, Nov 22 2014 *)

%o (Magma) [2^(n-1)*(8*n-14)+8 : n in [0..30]]; // _Vincenzo Librandi_, Sep 25 2011

%o (PARI) Vec((1-3*x+10*x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ _Colin Barker_, Aug 24 2016

%K nonn,easy

%O 0,2

%A _Clark Kimberling_

%E Formula from _Ralf Stephan_, Jan 15 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 30 08:41 EDT 2024. Contains 372131 sequences. (Running on oeis4.)