The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027014 a(n) = T(2*n, n+3), T given by A027011. 1

%I #7 Feb 19 2016 10:35:55

%S 1,10,203,1719,9484,40615,147760,481849,1458335,4194686,11658332,

%T 31674918,84807212,224985864,593525255,1560542957,4095205128,

%U 10735046293,28123686540,73654666767,192865240859,504973920796,1322099323816,3461379173004,9062108456296

%N a(n) = T(2*n, n+3), T given by A027011.

%H Colin Barker, <a href="/A027014/b027014.txt">Table of n, a(n) for n = 3..1000</a>

%H <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (10,-43,105,-161,161,-105,43,-10,1).

%F G.f.: x^3*(1+146*x^2+14*x^3+134*x^4-174*x^5+105*x^6-43*x^7+10*x^8-x^9) / ((1-x)^7*(1-3*x+x^2)). - _Colin Barker_, Feb 19 2016

%o (PARI) Vec(x^3*(1+146*x^2+14*x^3+134*x^4-174*x^5+105*x^6-43*x^7+10*x^8-x^9)/((1-x)^7*(1-3*x+x^2)) + O(x^40)) \\ _Colin Barker_, Feb 19 2016

%K nonn,easy

%O 3,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.

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)