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.

A061761 a(n) = 2^n + 2*n - 1.

Original entry on oeis.org

0, 3, 7, 13, 23, 41, 75, 141, 271, 529, 1043, 2069, 4119, 8217, 16411, 32797, 65567, 131105, 262179, 524325, 1048615, 2097193, 4194347, 8388653, 16777263, 33554481, 67108915, 134217781, 268435511, 536870969, 1073741883, 2147483709
Offset: 0

Views

Author

Amarnath Murthy, May 20 2001

Keywords

Examples

			a(5) = 2^5 + 2*5 - 1 = 32 + 10 - 1 = 41. - _Michael B. Porter_, Aug 18 2016
		

Crossrefs

Programs

Formula

G.f.: x(3-5x)/((1-x)^2*(1-2x)). Binomial transform of 0,3,1,1,... (1 continued). - R. J. Mathar, Sep 17 2008
a(n) = A000225(n+1) - A005803(n), for n>0. In other words, for n>0, a(n) is the sum of the elements on the perimeter of a Pascal's triangle of depth (n+1). - Ivan N. Ianakiev, Aug 18 2016
E.g.f.: exp(x)*(exp(x) + 2*x - 1). - Stefano Spezia, Dec 08 2024