This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048480 a(n) = T(8,n), array T given by A048472. 1

%I

%S 1,10,37,109,289,721,1729,4033,9217,20737,46081,101377,221185,479233,

%T 1032193,2211841,4718593,10027009,21233665,44826625,94371841,

%U 198180865,415236097,868220929,1811939329,3774873601,7851737089,16307453953,33822867457,70061654017

%N a(n) = T(8,n), array T given by A048472.

%H Vincenzo Librandi, <a href="/A048480/b048480.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = 9*n * 2^(n-1) + 1.

%F a(0)=1, a(1)=10, a(2)=37, a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3). - _Harvey P. Dale_, Jul 09 2014

%F G.f.: (1+5*x-5*x^2) / ((1-x)*(1-2*x)^2). - _Colin Barker_, Feb 18 2016

%t Table[9*n*2^(n-1)+1,{n,0,30}] (* or *) LinearRecurrence[{5,-8,4},{1,10,37},30] (* _Harvey P. Dale_, Jul 09 2014 *)

%o (MAGMA) [9*n * 2^(n-1) + 1: n in [0..30]]; // _Vincenzo Librandi_, Sep 23 2011

%o (PARI) Vec((1+5*x-5*x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ _Colin Barker_, Feb 18 2016

%Y Cf. A008591 (contains n-th difference of a(n),a(n-1),...,a(0)).

%K nonn,easy

%O 0,2

%A _Clark Kimberling_

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

Last modified July 18 19:00 EDT 2019. Contains 325144 sequences. (Running on oeis4.)