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!)
A048514 a(n) = T(0,n)+T(1,n-1)+...+T(n,0), array T given by A048505. 2

%I #15 Aug 01 2022 10:23:22

%S 1,3,13,54,190,587,1659,4412,11244,27785,67089,159106,371930,859159,

%T 1964855,4454968,10025240,22411221,49804909,110097630,242217766,

%U 530575683,1157623603,2516577524,5452589700,11777599457

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

%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (10,-42,96, -129,102,-44,8).

%F G.f.: (8*x^5-37*x^4+46*x^3-25*x^2+7*x-1) / ((x-1)^4*(2*x-1)^3). - _Colin Barker_, Feb 25 2015

%t LinearRecurrence[{10,-42,96,-129,102,-44,8},{1,3,13,54,190,587,1659},30] (* _Harvey P. Dale_, Aug 01 2022 *)

%o (PARI)

%o T(k, n) = (n^2 + (4*k+1)*n + (2*k)^2) * 2^(n-2) - k^2 + 1

%o a(n) = sum(k=0, n, T(k,n-k)) \\ _Colin Barker_, Feb 25 2015

%K nonn

%O 0,2

%A _Clark Kimberling_

%E Typo in a(25) fixed by _Colin Barker_, Feb 25 2015

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