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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027116 a(n) = T(n, n+3), T given by A027113. 0
7, 23, 56, 120, 241, 467, 886, 1660, 3087, 5715, 10552, 19452, 35825, 65943, 121342, 223240, 410663, 755391, 1389448, 2555664, 4700673, 8645963, 15902486, 29249316, 53797967, 98949979, 181997480, 334745652, 615693345 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

LINKS

Table of n, a(n) for n=3..31.

FORMULA

Conjectures from Colin Barker, Feb 20 2016: (Start)

a(n) = 3*a(n-1)-2*a(n-2)-a(n-4)+a(n-5) for n>7.

G.f.: x^3*(7+2*x+x^2-2*x^3) / ((1-x)^2*(1-x-x^2-x^3)).

(End)

CROSSREFS

Sequence in context: A261893 A022815 A172252 * A151718 A027918 A058195

Adjacent sequences:  A027113 A027114 A027115 * A027117 A027118 A027119

KEYWORD

nonn

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 23:10 EST 2016. Contains 278755 sequences.