login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A295717 a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 1, a(1) = 3, a(2) = 5, a(3) = 7. 1
1, 3, 5, 7, 14, 19, 37, 52, 97, 141, 254, 379, 665, 1012, 1741, 2689, 4558, 7119, 11933, 18796, 31241, 49525, 81790, 130291, 214129, 342372, 560597, 898873, 1467662, 2358343, 3842389, 6184348, 10059505, 16211085, 26336126, 42481675, 68948873, 111299476 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
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
FORMULA
a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 3, a(2) = 5, a(3) = 7.
G.f.: (1 + 2 x - x^2 - 5 x^3)/(1 - x - 3 x^2 + 2 x^3 + 2 x^4).
MATHEMATICA
LinearRecurrence[{1, 3, -2, -2}, {1, 3, 5, 7}, 100]
CROSSREFS
Sequence in context: A333630 A114980 A024372 * A308591 A309832 A319784
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Nov 29 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 14:21 EDT 2024. Contains 371254 sequences. (Running on oeis4.)