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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159694 a(0)=6, a(n) = 2*a(n-1) + 2^(n-1) for n>0 . 7
6, 13, 28, 60, 128, 272, 576, 1216, 2560, 5376, 11264, 23552, 49152, 102400, 212992, 442368, 917504, 1900544, 3932160, 8126464, 16777216, 34603008, 71303168, 146800640, 301989888, 620756992, 1275068416, 2617245696, 5368709120 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Diagonal of triangles A062111, A152920 .

LINKS

Table of n, a(n) for n=0..28.

M. Janjic and B. Petkovic, A Counting Function, arXiv 1301.4550, 2013

M. Janjic, B. Petkovic, A Counting Function Generalizing Binomial Coefficients and Some Other Classes of Integers, J. Int. Seq. 17 (2014) # 14.3.5

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

FORMULA

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

Contribution from Klaus Brockhaus, Sep 27 2009: (Start)

a(n) = (6+n/2)*2^n.

G.f.: (-11*x + 6)/(1-2*x)^2. (End)

EXAMPLE

a(0)=6, a(1)=2*6+1=13, a(2)=2*13+2=28, a(3)=2*28+4=60, a(4)=2*60+8=128, ...

CROSSREFS

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

Seventh row of triangle A062111. [From Klaus Brockhaus, Sep 27 2009]

Sequence in context: A116913 A016071 A086652 * A145976 A101622 A256871

Adjacent sequences:  A159691 A159692 A159693 * A159695 A159696 A159697

KEYWORD

easy,nonn

AUTHOR

Philippe Deléham, 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 22 00:52 EDT 2019. Contains 328315 sequences. (Running on oeis4.)