OFFSET
0,3
COMMENTS
Suppose that s = (s(n)) and t = (t(n)) are sequences of numbers and h > 0 and k > 0. The lower (h, k)-midsequence of s and t is floor(h*s + k*t); the upper (h, k)-midsequence of s and t is ceiling(h*s + k*t).
LINKS
Index entries for linear recurrences with constant coefficients, signature (3,-3,1,0,0,1,-3,3,-1).
FORMULA
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) + a(n-6) - 3*a(n-7) + 3*a(n-8) - a(n-9), with (a(0),...,a(8)) = (0,1,5,14,30,55,90,139,203).
G.f.: x*(1 + 2*x + 2*x^2 + 2*x^3 + 2*x^4 + x^5 + 3*x^6 - x^7)/((-1 + x)^4*(1 + x + x^2 + x^3 + x^4 + x^5)).
EXAMPLE
MATHEMATICA
f[n_] := n^2; g[n_] := n^3; r = 1/2; s = 1/3;
u[n_] := Floor[r*f[n] + s*g[n]]
v[n_] := Ceiling[r*f[n] + s*g[n]]
Table[u[n], {n, 0, z}] (* A389582 *)
Table[v[n], {n, 0, z}] (* A389583 *)
(* Also *)
LinearRecurrence[{3, -3, 1, 0, 0, 1, -3, 3, -1}, {0, 0, 4, 13, 29, 54, 90, 138, 202}, 30] (* A390582 *)
LinearRecurrence[{3, -3, 1, 0, 0, 1, -3, 3, -1}, {0, 1, 5, 14, 30, 55, 90, 139, 203}, 30] (* A390583 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Dec 07 2025
STATUS
approved
