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!)
A026915 a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026907. 1

%I #9 Feb 18 2016 09:57:28

%S 1,26,100,272,640,1400,2944,6056,12304,24824,49888,100040,200368,

%T 401048,802432,1605224,3210832,6422072,12844576,25689608,51379696,

%U 102759896,205520320,411041192,822082960,1644166520,3288333664,6576667976,13153336624,26306673944

%N a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026907.

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

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

%F a(n) = 49*2^n - 24*n - 48.

%F a(n) = 4*a(n-1)-5*a(n-2)+2*a(n-3) for n>2. G.f.: (1+22*x+x^2) / ((1-x)^2*(1-2*x)). - _Colin Barker_, Feb 18 2016

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

%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 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)