cp's OEIS Frontend

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.

A175163 a(n) = 32*(2^n + 1).

Original entry on oeis.org

64, 96, 160, 288, 544, 1056, 2080, 4128, 8224, 16416, 32800, 65568, 131104, 262176, 524320, 1048608, 2097184, 4194336, 8388640, 16777248, 33554464, 67108896, 134217760, 268435488, 536870944
Offset: 0

Views

Author

Reinhard Zumkeller, Feb 28 2010

Keywords

Crossrefs

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).
Cf. A173786.

Programs

  • 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
    
  • Mathematica
    32*(2^Range[0,40] + 1) (* G. C. Greubel, Jul 08 2021 *)
  • Sage
    [32*(2^n +1) for n in (0..40)] # G. C. Greubel, Jul 08 2021

Formula

a(n) = A173786(n+5, 5).
a(n) = 3*a(n-1) - 2*a(n-2), a(0)=64, a(1)=96. - Vincenzo Librandi, Dec 28 2010
G.f.: 32*(2 - 3*x)/((1 - x)*(1 - 2*x)). - Chai Wah Wu, Jul 24 2020
E.g.f.: 32*(exp(2*x) + exp(x)). - G. C. Greubel, Jul 08 2021