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!)
A027180 a(n) = Sum_{0<=j<=i<=n} A027170(i, j). 1

%I #15 Oct 24 2019 19:14:22

%S 1,7,27,79,199,459,1003,2119,4383,8947,18115,36495,73303,146971,

%T 294363,589207,1178959,2358531,4717747,9436255,18873351,37747627,

%U 75496267,150993639,301988479,603978259,1207957923,2415917359,4831836343,9663674427,19327350715

%N a(n) = Sum_{0<=j<=i<=n} A027170(i, j).

%H Colin Barker, <a href="/A027180/b027180.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (5,-9,7,-2).

%F a(n) = 18*2^n - 2*n^2 - 10*n - 17.

%F From _Colin Barker_, Feb 20 2016: (Start)

%F a(n) = 5*a(n-1)-9*a(n-2)+7*a(n-3)-2*a(n-4) for n>3.

%F G.f.: (1+x)^2 / ((1-x)^3*(1-2*x)).

%F (End)

%t LinearRecurrence[{5,-9,7,-2},{1,7,27,79},50] (* _Harvey P. Dale_, Jul 08 2019 *)

%o (PARI) Vec((1+x)^2/((1-x)^3*(1-2*x)) + O(x^40)) \\ _Colin Barker_, Feb 20 2016

%Y Partial sums of A027178.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_

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 April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)