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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159695 a(0)=7, a(n) = 2*a(n-1) + 2^(n-1) for n > 0. 7
7, 15, 32, 68, 144, 304, 640, 1344, 2816, 5888, 12288, 25600, 53248, 110592, 229376, 475136, 983040, 2031616, 4194304, 8650752, 17825792, 36700160, 75497472, 155189248, 318767104, 654311424, 1342177280, 2751463424, 5637144576 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Diagonal of triangles A062111, A152920.

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..3300

FORMULA

a(n) = Sum_{k=0..n} (k+7)*binomial(n,k).

From R. J. Mathar, Apr 20 2009: (Start)

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

a(n) = 4*a(n-1) - 4*a(n-2).

G.f.: (7-13*x)/(1-2x)^2. (End)

E.g.f.: (x+7)*exp(2*x). - G. C. Greubel, Jun 02 2018

EXAMPLE

a(0)=7, a(1) = 2*7 + 1 = 15, a(2) = 2*15 + 2 = 32, a(3) = 2*32 + 4 = 68, a(4) = 2*68 + 8 = 144, ...

MATHEMATICA

LinearRecurrence[{4, -4}, {7, 15}, 30] (* or *) Table[(14+n)*2^(n-1), {n, 0, 30}] (* G. C. Greubel, Jun 02 2018 *)

PROG

(PARI) for(n=0, 30, print1((14+n)*2^(n-1), ", ")) \\ G. C. Greubel, Jun 02 2018

(MAGMA) [(14+n)*2^(n-1): n in [0..30]]; // G. C. Greubel, Jun 02 2018

CROSSREFS

Cf. A000079, A001787, A001792, A045623, A045891, A034007, A111297, A159694.

Sequence in context: A120094 A078485 A233297 * A014001 A291642 A271995

Adjacent sequences:  A159692 A159693 A159694 * A159696 A159697 A159698

KEYWORD

easy,nonn

AUTHOR

Philippe Deléham, Apr 20 2009

EXTENSIONS

More terms from R. J. Mathar, Apr 20 2009

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 October 21 14:04 EDT 2019. Contains 328299 sequences. (Running on oeis4.)