OFFSET
0,1
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) = a(n-1) + a(n-2) - a(n-4) - a(n-5) + a(n-6), with (a(0),...,a(5)) = (1, 3, 7, 12, 20).
G.f.: (-2 - 2*x^2 - x^3 - 2*x^4 - 2*x^5 - 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+2)^2) = (4, 9, 16, 25, 36, 49, 64, 81, ...).
u(n) = (1, 3, 7, 12, 20, 28, 39, 51, 65, 80, 98, 116, 137, ...).
v(n) = (2, 4, 8, 13, 20, 29, 40, 52, 66, 81, 98, 117, 138, ...).
MATHEMATICA
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Mar 22 2026
STATUS
approved
