This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A175165 #22 Jun 27 2023 17:29:57
%S A175165 0,32,96,224,480,992,2016,4064,8160,16352,32736,65504,131040,262112,
%T A175165 524256,1048544,2097120,4194272,8388576,16777184,33554400,67108832,
%U A175165 134217696,268435424,536870880
%N A175165 a(n) = 32*(2^n - 1).
%H A175165 G. C. Greubel, <a href="/A175165/b175165.txt">Table of n, a(n) for n = 0..1000</a>
%H A175165 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).
%F A175165 a(n) = 2^(n+5) - 32.
%F A175165 a(n) = A173787(n+5, 5).
%F A175165 a(n) = 3*a(n-1) - 2*a(n-2); a(0)=0, a(1)=32. - _Vincenzo Librandi_, Dec 28 2010
%F A175165 From _G. C. Greubel_, Jul 08 2021: (Start)
%F A175165 G.f.: 32*x/((1-x)*(1-2*x)).
%F A175165 E.g.f.: 32*(exp(2*x) - exp(x)). (End)
%t A175165 32(2^Range[0,30] -1) (* or *) LinearRecurrence[{3,-2},{0,32},30] (* _Harvey P. Dale_, Mar 23 2015 *)
%o A175165 (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 A175165 (Sage) [32*(2^n -1) for n in (0..40)] # _G. C. Greubel_, Jul 08 2021
%o A175165 (Python)
%o A175165 def A175165(n): return (1<<n)-1<<5 # _Chai Wah Wu_, Jun 27 2023
%Y A175165 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 A175165 Cf. A173787.
%K A175165 nonn
%O A175165 0,2
%A A175165 _Reinhard Zumkeller_, Feb 28 2010