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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048474 3*n*2^(n-1) + 1. 4
1, 4, 13, 37, 97, 241, 577, 1345, 3073, 6913, 15361, 33793, 73729, 159745, 344065, 737281, 1572865, 3342337, 7077889, 14942209, 31457281, 66060289, 138412033, 289406977, 603979777, 1258291201, 2617245697, 5435817985 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Original name: a(n) = T(2, n), array T given by A048472.

Binomial transform of A008486. - Paul Barry, Jul 09 2003

Row sums of triangle A134232. - Gary W. Adamson, Oct 14 2007

LINKS

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

FORMULA

a(0)=1, a(1)=4, a(2)=13, a(n)=5*a(n-1)-8*a(n-2)+4*a(n-3) [From Harvey P. Dale, Jan 29 2012]

G.f.: (-x^2+x-1)/((x-1)(2*x-1)^2) [From Harvey P. Dale, Jan 29 2012]

MATHEMATICA

Table[3n 2^(n-1)+1, {n, 0, 30}] (* or *) LinearRecurrence[{5, -8, 4}, {1, 4, 13}, 30] (* From Harvey P. Dale, Jan 29 2012 *)

PROG

(MAGMA) [3*n * 2^(n-1) + 1: n in [0..30]]; // vincenzo Librandi, Sep 23 2011

CROSSREFS

n-th difference of a(n), a(n-1), ..., a(0) is (3, 6, 9, ...).

Cf. A134232.

Sequence in context: A067635 A003727 A103082 * A054761 A080145 A097551

Adjacent sequences:  A048471 A048472 A048473 * A048475 A048476 A048477

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Better description from Paul Barry, Jul 09 2003

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 17 21:13 EST 2012. Contains 206085 sequences.