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.

A083706 a(n) = 2^(n+1) + n - 1.

Original entry on oeis.org

1, 4, 9, 18, 35, 68, 133, 262, 519, 1032, 2057, 4106, 8203, 16396, 32781, 65550, 131087, 262160, 524305, 1048594, 2097171, 4194324, 8388629, 16777238, 33554455, 67108888, 134217753, 268435482, 536870939, 1073741852, 2147483677, 4294967326, 8589934623, 17179869216
Offset: 0

Views

Author

N. J. A. Sloane, Jun 15 2003

Keywords

Comments

Is A247983(n+1) = A247983(n) if and only if n is in A083706? - Clark Kimberling, Sep 28 2014
a(n) is the least number of nodes in a height-n 2-3-4 tree, if using the top-down insertion algorithm and there have been no deletions. - Daniel S. Roche, Oct 05 2014
Also the number of independent vertex sets and vertex covers in the n-crown graph. - Andrew Howroyd, May 14 2017

Crossrefs

Programs

Formula

G.f.: (1-2*x^2)/((1-x)^2*(1-2*x)).
a(n) = 2*a(n-1) + 3 - n.
Row sums of A130301. - Gary W. Adamson, May 20 2007
From Elmo R. Oliveira, Mar 06 2025: (Start)
E.g.f.: exp(x)*(x + 2*exp(x) - 1).
a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3). (End)