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!)
A242558 a(n) = Sum_{j=0..n} Sum_{i=0..j} L(i)*F(j) where L(i)=A000032(i) and F(j)=A000045(j). 0

%I #16 Aug 15 2016 10:07:45

%S 0,3,9,29,80,220,588,1563,4125,10857,28512,74792,196040,513619,

%T 1345281,3522981,9224880,24153636,63239220,165569195,433476725,

%U 1134874513,2971168704,7778667024,20364889680,53316094755,139583544633,365434781933

%N a(n) = Sum_{j=0..n} Sum_{i=0..j} L(i)*F(j) where L(i)=A000032(i) and F(j)=A000045(j).

%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (4,-2,-6,4,2,-1).

%F a(n) = A001519(n+2) - A000045(n+2) - A059841(n).

%F G.f.: -x*(-3+3*x+x^2) / ( (x-1)*(1+x)*(x^2-3*x+1)*(x^2+x-1) ). - _R. J. Mathar_, May 17 2014

%e For n=5, a(n) = F(2*5+3) - F(5+2) - 0 = 233 - 13 = 220.

%t LinearRecurrence[{4,-2,-6,4,2,-1},{0,3,9,29,80,220},30] (* _Harvey P. Dale_, Aug 15 2016 *)

%Y Cf. A190173, A000045, A000032, A242300, A242496.

%K nonn,easy

%O 0,2

%A _J. M. Bergot_, May 17 2014

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 25 08:20 EDT 2024. Contains 371964 sequences. (Running on oeis4.)