This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A108140 a(n) = 4*a(n-1) -3*a(n-2) -2*a(n-3) +a(n-4), n>8. 0
 1, 1, 1, 1, 0, 4, 17, 55, 161, 449, 1220, 3266, 8667, 22879, 60203, 158107, 414728, 1087064, 2848061, 7459703, 19535229, 51152749, 133933964, 350666854, 918095255, 2403665279, 6292975607, 16475382935, 43133369616, 112925043724 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Roger Bagula, Factoring Double Fibonacci Sequences, 2000 Index entries for linear recurrences with constant coefficients, signature (4, -3, -2, 1). FORMULA a(n) = -A000045(n+2)/2 + A001906(n-1)/2, n>3. [Sep 28 2009] G.f.:(-1+2*x^7-2*x^6-8*x^5-2*x^3+3*x)/((x^2+x-1)*(x^2-3*x+1)) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009] MATHEMATICA F[1] = 1; F[2] = 1; F[3] = 1; F[4] = 1; F[n__] := F[n] = 4*F[n - 1] - 3*F[n - 2] - 2*F[n - 3] + F[n - 4] a = Table[Abs[F[n]], {n, 1, 50}] CROSSREFS Cf. A056015, A056016. Sequence in context: A001585 A060262 A157492 * A213577 A255526 A264218 Adjacent sequences:  A108137 A108138 A108139 * A108141 A108142 A108143 KEYWORD nonn,easy AUTHOR Roger L. Bagula, Jun 05 2005 EXTENSIONS Definition replaced by recurrence by the Associate Editors of the OEIS, Sep 28 2009 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.

Last modified July 21 17:20 EDT 2019. Contains 325198 sequences. (Running on oeis4.)