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.

A323988 a(n) = 2^(n - 1) + binomial(n, floor(n/2))*(n + 1)/2.

Original entry on oeis.org

1, 2, 5, 10, 23, 46, 102, 204, 443, 886, 1898, 3796, 8054, 16108, 33932, 67864, 142163, 284326, 592962, 1185924, 2464226, 4928452, 10209620, 20419240, 42190558, 84381116, 173962532, 347925064, 715908428, 1431816856, 2941192472, 5882384944, 12065310083, 24130620166
Offset: 0

Views

Author

N. J. A. Sloane, Feb 13 2019

Keywords

Comments

This sequence was obtained by omitting the two initial zeros from A191386, which has a more complicated definition. The simple formula defining this sequence was found by Dan Velleman and Stan Wagon. See A191386 for further information, including references.

Crossrefs

Cf. A191386.

Programs

Formula

G.f.: (1+s)/(2*s*(1-2*x)), where s = sqrt(1-4*x^2).
a(0) = 1, a(1) = 2, a(2) = 5; thereafter (8*n+16)*a(n) + (-4*n-8)*a(n+1) + (-2*n-6)*a(n+2) + (n+3)*a(n+3) = 0.