login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061761 a(n) = 2^n + 2*n - 1. 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n=0..200

Index entries for linear recurrences with constant coefficients, signature (4,-5,2)

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

EXAMPLE

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

MATHEMATICA

Table[2^n+2*n-1, {n, 0, 60}] (* Vladimir Joseph Stephan Orlovsky, Feb 15 2011 *)

PROG

(PARI) { for (n=0, 200, write("b061761.txt", n, " ", 2^n + 2*n - 1) ) } \\ Harry J. Smith, Jul 27 2009

CROSSREFS

Cf. A000225, A005803.

Sequence in context: A078447 A066624 A317783 * A081494 A161909 A281131

Adjacent sequences:  A061758 A061759 A061760 * A061762 A061763 A061764

KEYWORD

nonn

AUTHOR

Amarnath Murthy, May 20 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 15 18:59 EST 2019. Contains 329149 sequences. (Running on oeis4.)