OFFSET
0,2
COMMENTS
Suppose that s = (s(n)) and t = (t(n)) are integer sequences. The lower midsequence, m = m(s,t), of s and t is defined by m(n) = floor((s(n) + t(n))/2). The upper midsequence, M = M(s,t), is defined by M(n) = ceiling((s(n) + t(n))/2).
LINKS
Index entries for linear recurrences with constant coefficients, signature (1,1,1,-1,-1).
FORMULA
a(n) = a(n-1) + a(n-2) + a(n-3) - a(n-4) - a(n-5) for n >= 5.
G.f.: (1 + x - x^4)/(1 - x - x^2 - x^3 + x^4 + x^5).
G.f.: ((1 + x - x^4)/((-1 + x) (-1 + x + x^2) (1 + x + x^2))).
a(n) = (3*((5 - 4*sqrt(5))*(1 - sqrt(5))^n + (1 + sqrt(5))^n*(5 + 4*sqrt(5)))/2^n + 10*(cos(2*n*Pi/3) - 1))/30. - Stefano Spezia, Jul 17 2022
EXAMPLE
a(0) = 1 = floor((1+1)/2);
a(1) = 2 = floor((2+3)/2);
a(2) = 3 = floor((3+4)/2).
The Fibonacci and Lucas numbers are interspersed:
1 < 2 < 3 < 4 < 5 < 7 < 8 < 11 < 13 < 18 < 21 < 29 < ...
The midsequences m and M intersperse the ordered union of the Fibonacci and Lucas sequences, A116470, as indicated by the following table:
F m M L
1 1 1 1
2 2 3 3
3 3 4 4
5 6 6 7
8 9 10 11
13 15 16 18
21 25 25 29
MATHEMATICA
PROG
(Python)
from sympy import fibonacci, lucas
def A355324(n): return fibonacci(n+2)+lucas(n+1)>>1 # Chai Wah Wu, Aug 08 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 16 2022
STATUS
approved