OFFSET
0,2
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 (2,-1,0,0,0,1,-2,1).
FORMULA
a(n) = 2*a(n-1) - a(n-2) + a(n-6) - 2*a(n-7) + a(n-8), with (a(0),...,a(7)) = (1, 2, 5, 10, 17, 25, 35, 46).
G.f.: (-1 - 2*x^2 - 2*x^3 - 2*x^4 - x^5 - x^6 - x^7)/((-1 + x)^3*(1 + x + x^2 + x^3 + x^4 + x^5)).
EXAMPLE
s = (n^2) = A000290 = (0, 1, 4, 9, 16, 25, 36, ...).
t = ((n+1)^2) = (1, 4, 9, 16, 25, 36, 49, 64, ...).
u(n) = (0, 1, 5, 9, 16, 24, 34, 45, 59, 73, 90, 108, ...).
v(n) = (1, 2, 5, 10, 17, 25, 35, 46, 59, 74, 91, 109, ...).
MATHEMATICA
f[n_] := n^2; g[n_] := (n+1)^2; r = 1/2; s = 1/3;
u[n_] := Floor[r*f[n] + s*g[n]];
v[n_] := Ceiling[r*f[n] + s*g[n]];
v[n_] := Ceiling[r*f[n] + s*g[n]];
Table[u[n], {n, 0, 50}] (* A393678 *)
Table[v[n], {n, 0, 50}] (* A393679 *)
(* Also *)
LinearRecurrence[{1, 1, 0, -1, -1, 1}, {0, 1, 5, 9, 16, 24}, 50] (* A393678 *)
LinearRecurrence[{2, -1, 0, 0, 0, 1, -2, 1}, {1, 2, 5, 10, 17, 25, 35, 46}, 50] (* A393679 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Mar 20 2026
STATUS
approved
