#include <bits/stdc++.h>
using namespace std;
int bot[100][100];
int n, t;
void so(int i, int j) {
  if (i > n + 2) return;
  if (bot[i][j] > 4096) {
    bot[i + 1][j + 1] += (bot[i][j] - 4096) / 2;
    bot[i + 1][j] += (bot[i][j] - 4096) / 2;
    bot[i][j] = 4096;
    so(i + 1, j + 1);
    so(i + 1, j);
  }
}
int main() {
  cin >> n >> t;
  if (t == 0) {
    cout << 0 << endl;
    return 0;
  }
  memset(bot, 0, sizeof(bot));
  bot[0][0] = 4096;
  for (int tt = 1; tt < t; tt++) {
    bot[0][0] += 4096;
    so(0, 0);
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      if (bot[i][j] == 4096) {
        ans++;
      }
    }
  }
  cout << ans << endl;
}
