login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027974 Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A027960. 6
1, 5, 14, 35, 81, 180, 389, 825, 1726, 3575, 7349, 15020, 30561, 61965, 125294, 252795, 509161, 1024100, 2057549, 4130225, 8284926, 16609455, 33282989, 66669660, 133507081, 267285605, 535010414, 1070731475, 2142612801 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..28.

Index entries for linear recurrences with constant coefficients, signature (3,-1,-2).

FORMULA

a(n) = 8*2^n - Fibonacci(n+5) - Fibonacci(n+3).

a(n) = A101220(4, 2, n+1).

G.f.: (1+2*x)/((1-2*x)*(1-x-x^2)). [R. J. Mathar, Sep 22 2008]

CROSSREFS

Sequence in context: A066767 A227200 * A027983 A142585 A234097 A211562

Adjacent sequences:  A027971 A027972 A027973 * A027975 A027976 A027977

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 December 18 14:22 EST 2018. Contains 318229 sequences. (Running on oeis4.)