Constrained Subsequence Sum

Given an array of integers nums and an integer k, find the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] and nums[j], the absolute difference between i and j is at most k.