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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048487 a(n) = T(4,n), array T given by A048483. 8
1, 6, 16, 36, 76, 156, 316, 636, 1276, 2556, 5116, 10236, 20476, 40956, 81916, 163836, 327676, 655356, 1310716, 2621436, 5242876, 10485756, 20971516, 41943036, 83886076, 167772156, 335544316, 671088636, 1342177276, 2684354556 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Row sums of triangle A131113. - Gary W. Adamson, Jun 15 2007

a(n) = sum of (n+1)-th row terms of triangle A134636. This sequence is the binomial transform of 1, 5, 5, (5 continued). - Gary W. Adamson, Nov 04 2007

Row sums of triangle A135856. - Gary W. Adamson, Dec 01 2007

LINKS

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

FORMULA

a(n) = 5*2^n-4. - Henry Bottomley, May 29 2001

a(n) = 2*a(n-1)+4, n>0, a(0)=1 - Paul Barry, Aug 25 2004

MATHEMATICA

a=1; lst={a}; k=5; Do[a+=k; AppendTo[lst, a]; k+=k, {n, 0, 5!}]; lst [From Vladimir Orlovsky, Dec 15 2008]

a=6; lst={1, a}; k=10; Do[a+=k; AppendTo[lst, a]; k+=k, {n, 0, 5!}]; lst [From Vladimir Orlovsky, Dec 17 2008]

PROG

(MAGMA)[5*2^n-4: n in [0..30]]; // Vincenzo Librandi, Sep 23 2011

CROSSREFS

Cf. A010716 (n-th difference of a(n), a(n-1), ..., a(0)).

Diagonal of A062001. Cf. A048483.

A column of A119726.

Cf. A131113.

Cf. A134636.

Cf. A135856.

Sequence in context: A178465 A120586 A171373 * A124699 A064602 A058272

Adjacent sequences:  A048484 A048485 A048486 * A048488 A048489 A048490

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 07:10 EST 2012. Contains 205874 sequences.