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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A295732 a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -1, a(1) = -1, a(2) = -1, a(3) = 1. 1
 -1, -1, -1, 1, 2, 9, 15, 36, 59, 119, 194, 361, 587, 1044, 1695, 2931, 4754, 8069, 13079, 21916, 35507, 58959, 95490, 157521, 255059, 418724, 677879, 1108891, 1794962, 2928429, 4739775, 7717356, 12489899, 20305559, 32860994, 53363161, 86355227, 140111604 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS a(n)/a(n-1) -> (1 + sqrt(5))/2 = golden ratio (A001622), so that a( ) has the growth-rate of the Fibonacci numbers (A000045). LINKS Clark Kimberling, Table of n, a(n) for n = 0..2000 Index entries for linear recurrences with constant coefficients, signature (1, 3, -2, -2) FORMULA a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = -1, a(1) = -1, a(2) = -1, a(3) = 1. G.f.: (-1 + 3 x^2 + 3 x^3)/(1 - x - 3 x^2 + 2 x^3 + 2 x^4). MATHEMATICA LinearRecurrence[{1, 3, -2, -2}, {-1, -1, -1, 1}, 100] CROSSREFS Cf. A001622, A000045, A005672. Sequence in context: A063094 A108463 A056724 * A083174 A067547 A166374 Adjacent sequences:  A295729 A295730 A295731 * A295733 A295734 A295735 KEYWORD easy,sign AUTHOR Clark Kimberling, Nov 30 2017 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 June 19 09:44 EDT 2021. Contains 345126 sequences. (Running on oeis4.)