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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145071 Partial sums of A000051, starting at n=1. 5
3, 8, 17, 34, 67, 132, 261, 518, 1031, 2056, 4105, 8202, 16395, 32780, 65549, 131086, 262159, 524304, 1048593, 2097170, 4194323, 8388628, 16777237, 33554454, 67108887, 134217752, 268435481, 536870938, 1073741851, 2147483676 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) = A127330(n,n) = A052944(n-1) + 2. - Reinhard Zumkeller, Nov 16 2013

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

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

FORMULA

a(1) = 3; a(n) = a(n-1) + 2^n + 1 for n > 1.

a(n) = 2^(n+1) + n - 2. - Franklin T. Adams-Watters, Jul 06 2009

G.f.: x*(3-4*x)/((1-x)^2*(1-2*x)). - Colin Barker, Jan 11 2012

EXAMPLE

a(2) = a(1) + 2^2 + 1 = 3 + 4 + 1 = 8; a(3) = a(2) + 2^3 + 1 = 8 + 8 + 1 = 17.

MATHEMATICA

lst={}; s=0; Do[s+=2^n+1; AppendTo[lst, s], {n, 5!}]; lst

PROG

(ARIBAS) a:=0; for n:=1 to 30 do a:=a+2**n+1; write(a, ", "); end;

(Haskell)

a145071 n = 2 ^ (n + 1) + n - 2

a145071_list = scanl1 (+) $ tail a000051_list

-- Reinhard Zumkeller, Nov 16 2013

CROSSREFS

Cf. A000051 (2^n + 1), A000225 (2^n - 1), A000295 (Eulerian numbers).

Sequence in context: A305105 A163312 A131253 * A182734 A239844 A182616

Adjacent sequences:  A145068 A145069 A145070 * A145072 A145073 A145074

KEYWORD

nonn,easy

AUTHOR

Vladimir Joseph Stephan Orlovsky, Sep 30 2008

EXTENSIONS

Edited by Klaus Brockhaus, Oct 14 2008

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 February 18 19:54 EST 2019. Contains 320262 sequences. (Running on oeis4.)