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!)
A101156 a(n) = 2*Fibonacci(n) + 8*Fibonacci(n-5). 3
10, 24, 34, 58, 92, 150, 242, 392, 634, 1026, 1660, 2686, 4346, 7032, 11378, 18410, 29788, 48198, 77986, 126184, 204170, 330354, 534524, 864878, 1399402, 2264280, 3663682, 5927962, 9591644, 15519606, 25111250, 40630856, 65742106, 106372962, 172115068 (list; graph; refs; listen; history; text; internal format)
OFFSET

5,1

LINKS

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

H. Zhao and X. Li, On the Fibonacci numbers of trees, Fib. Quart., 44 (2006), 32-38.

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

FORMULA

From Colin Barker, Jul 30 2013: (Start)

a(n) = a(n-1) + a(n-2).

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

MAPLE

with(combinat): A101156:=n->2*fibonacci(n)+8*fibonacci(n-5): seq(A101156(n), n=5..50); # Wesley Ivan Hurt, Jan 23 2017

MATHEMATICA

Table[2Fibonacci[n]+8Fibonacci[n-5], {n, 5, 40}] (* Harvey P. Dale, Jul 15 2013 *)

LinearRecurrence[{1, 1}, {10, 24}, 35] (* Vincenzo Librandi, Jan 24 2017 *)

PROG

(PARI) Vec(-2*x^5*(7*x+5)/(x^2+x-1) + O(x^50)) \\ Colin Barker, Mar 07 2016

(MAGMA) [2*Fibonacci(n)+8*Fibonacci(n-5): n in [5..40]]; // Vincenzo Librandi, Jan 24 2017

CROSSREFS

Sequence in context: A175425 A076675 A063925 * A267431 A162817 A103573

Adjacent sequences:  A101153 A101154 A101155 * A101157 A101158 A101159

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Oct 03 2007

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 August 4 11:01 EDT 2021. Contains 346447 sequences. (Running on oeis4.)