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

 


a(n) = 32*(2^n - 1).
5

%I #22 Jun 27 2023 17:29:57

%S 0,32,96,224,480,992,2016,4064,8160,16352,32736,65504,131040,262112,

%T 524256,1048544,2097120,4194272,8388576,16777184,33554400,67108832,

%U 134217696,268435424,536870880

%N a(n) = 32*(2^n - 1).

%H G. C. Greubel, <a href="/A175165/b175165.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) = 2^(n+5) - 32.

%F a(n) = A173787(n+5, 5).

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

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

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

%F E.g.f.: 32*(exp(2*x) - exp(x)). (End)

%t 32(2^Range[0,30] -1) (* or *) LinearRecurrence[{3,-2},{0,32},30] (* _Harvey P. Dale_, Mar 23 2015 *)

%o (Magma) I:=[0,32]; [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) [32*(2^n -1) for n in (0..40)] # _G. C. Greubel_, Jul 08 2021

%o (Python)

%o def A175165(n): return (1<<n)-1<<5 # _Chai Wah Wu_, Jun 27 2023

%Y Sequences of the form m*(2^n - 1): A000225 (m=1), A000918 (m=2), A068156 (m=3), A028399 (m=4), A068293 (m=6), A159741 (m=8), A175164 (m=16), this sequence (m=32), A175166 (m=64).

%Y Cf. A173787.

%K nonn

%O 0,2

%A _Reinhard Zumkeller_, Feb 28 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 24 10:38 EDT 2024. Contains 376196 sequences. (Running on oeis4.)