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.

A005126 a(n) = 2^n + n + 1.

Original entry on oeis.org

2, 4, 7, 12, 21, 38, 71, 136, 265, 522, 1035, 2060, 4109, 8206, 16399, 32784, 65553, 131090, 262163, 524308, 1048597, 2097174, 4194327, 8388632, 16777241, 33554458, 67108891, 134217756, 268435485, 536870942, 1073741855, 2147483680, 4294967329, 8589934626
Offset: 0

Views

Author

Keywords

Comments

Binomial transform of (1, 1, 1, 0, 1, 0, 1, 0, 1, ...). - Gary W. Adamson, Jul 20 2007
Binomial transform of a(n) starts: 2, 6, 17, 47, 129, 355, 985, 2763, 7841, 22499, 65193, 190459, ... - Wesley Ivan Hurt, Oct 28 2014

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Essentially the same as row sums of A128715.
Cf. A194455.

Programs

Formula

G.f.: (2-4*x+x^2)/((1-2*x)*(1-x)^2). - Simon Plouffe
E.g.f.: exp(x)*(exp(x)+1+x) = U(0) where U(k) = 1 + x/(2^k - 2^k/(x + 1 - x^2*2^(k+1)/(x*2^(k+1) + (k+1)/U(k+1) )));(continued fraction, 3rd kind, 4-step ). - Sergei N. Gladkovskii, Dec 01 2012

Extensions

More terms from N. J. A. Sloane, Sep 28 2007