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 (5,-8,8,-8,8,-8,8,-8,8,-8,8,-7,3).
FORMULA
a(n) = 5*a(n-1) - 8*a(n-2) + 8*a(n-3) - 8*a(n-4) + 8*a(n-5) - 8*a(n-6) + 8*a(n-7) - 8*a(n-8) + 8*a(n-9) - 8*a(n-10) + 8*a(n-11) - 7*a(n-12) + 3*a(n-13), with (a(0),...,a(12)) = (1,3,6,11,23,57,156,450,1326,3952,11827,35448,106309).
EXAMPLE
MATHEMATICA
s[n_] := 3^n ; t[n_] := 5 n;
u[n_] := Floor[(s[n]/5 + t[n]/3)]
v[n_] := Ceiling[(s[n]/5 + t[n]/3)]
Table[u[n], {n, 0, 60}] (* A390563 *)
Table[v[n], {n, 0, 60}] (* A390564 *)
(* Also *)
LinearRecurrence[{5, -8, 8, -8, 8, -8, 8, -8, 8, -8, 8, -7, 3}, {1, 3, 6, 11, 23, 57, 156, 450, 1326, 3952, 11827, 35448, 106309}, 30]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Nov 19 2025
STATUS
approved
