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

%I #17 Sep 08 2022 08:44:52

%S 1,3,9,29,95,307,973,3033,9339,28511,86537,261637,788983,2375115,

%T 7141701,21457841,64439027,193448119,580606465,1742343645,5228079471,

%U 15686335523,47063200829,141197991049,423610750315,1270865805327

%N a(n) = T(0,n) + T(1,n-1) + ... + T(n,0), array T given by A048471.

%H Vincenzo Librandi, <a href="/A036550/b036550.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = (1/2) * (3^(n+1) - 2^(n+2) + 2n + 3). - _Ralf Stephan_, Feb 17 2004

%F 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

%o (Magma) [(1/2) * (3^(n+1) - 2^(n+2) + 2*n + 3): n in [0..30]]; // _Vincenzo Librandi_, Nov 12 2011

%Y Partial sums of A083323.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_

%E Corrected by _T. D. Noe_, Nov 07 2006

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 September 6 04:22 EDT 2024. Contains 375702 sequences. (Running on oeis4.)