login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027117 a(n) = A027113(n, n+4). 0
16, 59, 155, 352, 738, 1475, 2861, 5444, 10232, 19079, 35395, 65452, 120786, 222615, 409965, 754616, 1388592, 2554723, 4699643, 8644840, 15901266, 29247995, 53796541, 98948444, 181995832, 334743887, 615691459, 1132434708 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,1

LINKS

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

FORMULA

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

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

G.f.: x^4*(16-5*x-x^2-5*x^3+3*x^4) / ((1-x)^3*(1-x-x^2-x^3)).

(End)

CROSSREFS

Sequence in context: A235510 A220974 A063521 * A292537 A258730 A187173

Adjacent sequences:  A027114 A027115 A027116 * A027118 A027119 A027120

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 22:12 EST 2021. Contains 349435 sequences. (Running on oeis4.)