#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
//#define int long long  
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; g(...) 0
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
  b%=m;
  ll ans = 1;
  for (; e; b = b * b % m, e /= 2)
    if (e & 1) ans = ans * b % m;
  return ans;
}
const int N = 3030;
int a[N],dp[N][N];
const int inf = 1e9;
void solve(){
	int n;
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> a[i];
	}
	rep(i,0,n+2)rep(j,0,n+2)dp[i][j]=0;
	for(int i=2;i<=n;i++){
		for(int j=i;j<=n;j++)dp[i][j]=inf;
		int cnt=0;
		for(int j=i-1;j>=1;j--){
			if(a[j] + j >= i){
				dp[i][a[j] + j] = min(dp[i][j+a[j]],dp[j][i-1] + (cnt++));
			}
		}
		for(int j=i+1;j<=n;j++){
			dp[i][j] = min(dp[i][j],dp[i][j-1]);
		}
	}
	cout << dp[n][n] << endl;
}


int32_t main(){
  fastio;
  int t;
  cin >> t;
  while(t--){
  	solve();
  }
  



  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}