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 A175163 #21 Sep 08 2022 08:45:51 %S A175163 64,96,160,288,544,1056,2080,4128,8224,16416,32800,65568,131104, %T A175163 262176,524320,1048608,2097184,4194336,8388640,16777248,33554464, %U A175163 67108896,134217760,268435488,536870944 %N A175163 a(n) = 32*(2^n + 1). %H A175163 G. C. Greubel, <a href="/A175163/b175163.txt">Table of n, a(n) for n = 0..1000</a> %H A175163 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2). %F A175163 a(n) = A173786(n+5, 5). %F A175163 a(n) = 3*a(n-1) - 2*a(n-2), a(0)=64, a(1)=96. - _Vincenzo Librandi_, Dec 28 2010 %F A175163 G.f.: 32*(2 - 3*x)/((1 - x)*(1 - 2*x)). - _Chai Wah Wu_, Jul 24 2020 %F A175163 E.g.f.: 32*(exp(2*x) + exp(x)). - _G. C. Greubel_, Jul 08 2021 %t A175163 32*(2^Range[0,40] + 1) (* _G. C. Greubel_, Jul 08 2021 *) %o A175163 (Magma) I:=[64,96]; [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 A175163 (Sage) [32*(2^n +1) for n in (0..40)] # _G. C. Greubel_, Jul 08 2021 %Y A175163 Sequences of the form m*(2^n + 1): A000051 (m=0), A052548 (m=2), A140504 (m=4), A153973 (m=6), A231643 (m=5), A175161 (m=8), A175162 (m=16), this sequence (m=32). %Y A175163 Cf. A173786. %K A175163 nonn %O A175163 0,1 %A A175163 _Reinhard Zumkeller_, Feb 28 2010