#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N = 1e5 + 10;
const int P = 1e9 + 7;
int a[N];
map<int, int>mp;

void solve() {
	int pos = 1;
	priority_queue<int>ans[N];
	mp.clear();
	int n;
    cin>>n;
	for (int i = 1; i <= n; i++)  cin>>a[i];
	for (int i = 1; i <= n; i++) {
		int tmp = i - a[i];
		if (mp.find(tmp) != mp.end()) {
			ans[mp[tmp]].push(a[i]);
		} else {
			mp[tmp] = pos++;
			ans[mp[tmp]].push(a[i]);
		}
	}
	int res = 0;
	for (int i = 1; i < pos; i++) {
		while(ans[i].size()>=2){
			int tmp=ans[i].top();
			ans[i].pop();
			tmp+=ans[i].top();
			ans[i].pop();
			if(tmp>0) res+=tmp;
		}
	}
	cout<<res<<endl;
}

signed main() {

	int _  =1;
    cin>>_;
	while (_--) {
		solve();
	}
	return 0;
}