#include<bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> pii;
#define fi first
#define se second
int n,m,k;
void solve()
{
	scanf("%d",&n);
	vector<ll> a(n + 1);
	map<ll,vector<ll>> q;
	for(int i = 1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		ll res = a[i] - i;
		q[res].push_back(a[i]);
	}
	ll ans = 0;
	for(auto &t : q)
	{
		vector<ll> &v = t.se;
		sort(v.begin(),v.end());
		for(int i = v.size()-1;i > 0;i--)
		{
			ll a = v[i];
			ll b = v[i-1];
			if(a + b > 0)
			{
				ans += a + b;
				i --;
			}
		}
	}
	printf("%lld\n",ans);
	
}

int main()
{
	int t = 1;
	scanf("%d",&t);
	while(t--)
	{
		solve();
	}
	return 0;
	
}