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.

A246139 a(n) = 2^n + 10.

Original entry on oeis.org

11, 12, 14, 18, 26, 42, 74, 138, 266, 522, 1034, 2058, 4106, 8202, 16394, 32778, 65546, 131082, 262154, 524298, 1048586, 2097162, 4194314, 8388618, 16777226, 33554442, 67108874, 134217738, 268435466, 536870922, 1073741834, 2147483658, 4294967306
Offset: 0

Views

Author

Vincenzo Librandi, Aug 18 2014

Keywords

Comments

First trisection of A085688. [Bruno Berselli, Aug 19 2014]

Crossrefs

Cf. Sequences of the form 2^n + k: A000079 (k=0), A000051 (k=1), A052548 (k=2), A062709 (k=3), A140504 (k=4), A168614 (k=5), A153972 (k=6), A168415 (k=7), A242475 (k=8), A188165 (k=9), this sequence (k=10).
Cf. A085688.

Programs

  • Magma
    [2^n+10: n in [0..40]];
    
  • Mathematica
    Table[2^n + 10, {n, 0, 40}]
  • PARI
    vector(50, n, 2^(n-1)+10) \\ Derek Orr, Aug 18 2014

Formula

G.f.: (11 - 21*x)/(1 - 3*x + 2*x^2).
a(n) = A000079(n) + 10.
a(n) = 3*a(n-1) - 2*a(n-2) for n > 1.
E.g.f.: exp(2*x) + 10*exp(x). - Elmo R. Oliveira, Nov 11 2023