#include <bits/stdc++.h>
using namespace std;
double a[11][11];
int main() {
  int n, t;
  memset(a, 0, sizeof a);
  scanf("%d%d", &n, &t);
  a[1][1] = t;
  if (!t) {
    cout << 0 << endl;
    return 0;
  }
  int num = 1;
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j <= i; ++j) {
      if (a[i - 1][j - 1] - 1 >= 0 && a[i - 1][j] - 1 >= 0)
        a[i][j] = (a[i - 1][j - 1] - 1) / 2.0 + (a[i - 1][j] - 1) / 2.0;
      else if (a[i - 1][j] - 1 >= 0) {
        a[i][j] = (a[i - 1][j] - 1) / 2.0;
      } else if (a[i - 1][j - 1] - 1 >= 0) {
        a[i][j] = (a[i - 1][j - 1] - 1) / 2.0;
      }
      if (a[i][j] > 1.0 || fabs(a[i][j] - 1.0) < 1e-6) {
        num++;
      }
    }
  }
  cout << num << endl;
  return 0;
}
