login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036550 a(n) = T(0,n) + T(1,n-1) + ... + T(n,0), array T given by A048471. 2
1, 3, 9, 29, 95, 307, 973, 3033, 9339, 28511, 86537, 261637, 788983, 2375115, 7141701, 21457841, 64439027, 193448119, 580606465, 1742343645, 5228079471, 15686335523, 47063200829, 141197991049, 423610750315, 1270865805327 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

FORMULA

a(n) = (1/2) * (3^(n+1) - 2^(n+2) + 2n + 3). - Ralf Stephan, Feb 17 2004

G.f: (1/2)*(3/(1-3*x) - 4/(1-2*x) + 2*x/(1-x)^2 + 3/(1-x)). - Vincenzo Librandi, Nov 12 2011

PROG

(MAGMA) [(1/2) * (3^(n+1) - 2^(n+2) + 2*n + 3): n in [0..30]]; // Vincenzo Librandi, Nov 12 2011

CROSSREFS

Partial sums of A083323.

Sequence in context: A061534 A300044 A071728 * A290897 A289448 A071732

Adjacent sequences:  A036547 A036548 A036549 * A036551 A036552 A036553

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

EXTENSIONS

Corrected by T. D. Noe, Nov 07 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 16:37 EDT 2022. Contains 354119 sequences. (Running on oeis4.)