#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
using namespace std;
long long MOD = 998244353;
double eps = 1e-12;
int w[11][11];
void solve() {
  int n;
  cin >> n;
  int t;
  cin >> t;
  w[0][0] = t * 1024;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      if (w[i][j] >= 1024) {
        ans++;
        w[i + 1][j] += (w[i][j] - 1024) / 2;
        w[i + 1][j + 1] += (w[i][j] - 1024) / 2;
      }
    }
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
