#include <bits/stdc++.h>
using namespace std;
const int N = 1024 * 1024;
int n, t, dp[15][15];
int main(void) {
  while (~scanf("%d %d", &n, &t)) {
    memset(dp, 0, sizeof dp);
    for (int i = 1; i <= t; i++) {
      dp[1][1] += N;
      if (dp[1][1] > N) {
        dp[2][1] += (dp[1][1] - N) / 2;
        dp[2][2] += (dp[1][1] - N) / 2;
        dp[1][1] = N;
      }
      for (int j = 2; j <= n; j++) {
        for (int k = 1; k <= j; k++) {
          if (dp[j][k] >= N) {
            dp[j + 1][k] += (dp[j][k] - N) >> 1;
            dp[j + 1][k + 1] += (dp[j][k] - N) >> 1;
            dp[j][k] = N;
          }
        }
      }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++)
        if (dp[i][j] == N) ans++;
    }
    printf("%d\n", ans);
  }
  return 0;
}
