#include <bits/stdc++.h>
using namespace std;
double dp[1000] = {0};
int maxi;
int n;
int main() {
  int k = 1, row = 1, n, t, counting = 0, i;
  cin >> n >> t;
  ::n = n;
  maxi = (n * (n + 1)) / 2;
  dp[1] = t;
  for (i = 1; i <= maxi; ++i) {
    if (dp[i] > 1.0) {
      dp[i + row] += (dp[i] - 1) / 2.0;
      dp[i + row + 1] += (dp[i] - 1) / 2.0;
      dp[i] = 1;
    }
    if (i == k) {
      ++row;
      k += row;
    }
    if (row == n) break;
  }
  for (i = 1; i <= maxi; ++i) {
    if (dp[i] >= 1) ++counting;
  }
  cout << counting;
}
