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!)
A175162 a(n) = 16*(2^n + 1). 5

%I #18 Sep 08 2022 08:45:51

%S 32,48,80,144,272,528,1040,2064,4112,8208,16400,32784,65552,131088,

%T 262160,524304,1048592,2097168,4194320,8388624,16777232,33554448,

%U 67108880,134217744,268435472

%N a(n) = 16*(2^n + 1).

%H G. C. Greubel, <a href="/A175162/b175162.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).

%F a(n) = A173786(n+4, 4).

%F a(n) = 3*a(n-1) - 2*a(n-2), a(0)=32, a(1)=48. - _Vincenzo Librandi_, Dec 28 2010

%F From _G. C. Greubel_, Jul 08 2021: (Start)

%F G.f.: 16*(2 - 3*x)/(1-x)*(1-2*x)).

%F E.g.f.: 16*(exp(2*x)_+ exp(x)). (End)

%t 16*(2^Range[0,30] +1) (* or *) LinearRecurrence[{3,-2},{32,48},30] (* _Harvey P. Dale_, Jun 08 2017 *)

%o (Magma) I:=[32,48]; [n le 2 select I[n] else 3*Self(n-1) - 2*Self(n-2): n in [1..41]]; // _G. C. Greubel_, Jul 08 2021

%o (Sage) [16*(2^n +1) for n in (0..40)] # _G. C. Greubel_, Jul 08 2021

%Y Sequences of the form m*(2^n + 1): A000051 (m=1), A052548 (m=2), A140504 (m=4), A153973 (m=6), A231643 (m=5), A175161 (m=8), this sequence (m=16), A175163 (m=32).

%Y Cf. A173786.

%K nonn

%O 0,1

%A _Reinhard Zumkeller_, Feb 28 2010

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)