cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A036550 #17 Sep 08 2022 08:44:52
%S A036550 1,3,9,29,95,307,973,3033,9339,28511,86537,261637,788983,2375115,
%T A036550 7141701,21457841,64439027,193448119,580606465,1742343645,5228079471,
%U A036550 15686335523,47063200829,141197991049,423610750315,1270865805327
%N A036550 a(n) = T(0,n) + T(1,n-1) + ... + T(n,0), array T given by A048471.
%H A036550 Vincenzo Librandi, <a href="/A036550/b036550.txt">Table of n, a(n) for n = 0..1000</a>
%F A036550 a(n) = (1/2) * (3^(n+1) - 2^(n+2) + 2n + 3). - _Ralf Stephan_, Feb 17 2004
%F A036550 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 A036550 (Magma) [(1/2) * (3^(n+1) - 2^(n+2) + 2*n + 3): n in [0..30]]; // _Vincenzo Librandi_, Nov 12 2011
%Y A036550 Partial sums of A083323.
%K A036550 nonn,easy
%O A036550 0,2
%A A036550 _Clark Kimberling_
%E A036550 Corrected by _T. D. Noe_, Nov 07 2006