login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 26, 100, 272, 640, 1400, 2944, 6056, 12304, 24824, 49888, 100040, 200368, 401048, 802432, 1605224, 3210832, 6422072, 12844576, 25689608, 51379696, 102759896, 205520320, 411041192, 822082960, 1644166520, 3288333664, 6576667976, 13153336624, 26306673944 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Colin Barker, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (4,-5,2).

FORMULA

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

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

PROG

(PARI) Vec((1+22*x+x^2)/((1-x)^2*(1-2*x)) + O(x^40)) \\ Colin Barker, Feb 18 2016

CROSSREFS

Sequence in context: A175549 A159541 A144129 * A136293 A065013 A031434

Adjacent sequences:  A026912 A026913 A026914 * A026916 A026917 A026918

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 10:49 EDT 2021. Contains 347606 sequences. (Running on oeis4.)