#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sqr(x) (x) * (x)
#define mp make_pair
#define pii pair<dd, dd>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double dd;
const int N = 1e2 + 10;
int n;
dd a[N][N];
void doit(int i, int j, int k, dd w)
{
    if (!w)
        return;
    if (a[i][j] != 1.0)
    {
        if (w <= 1 - a[i][j])
            a[i][j] += w, w = 0;
        else
            w -= 1 - a[i][j], a[i][j] = 1;
    }
    if (k + 1 < n)
    {
        doit(i - 1, j - 1, k + 1, w / 2);
        doit(i - 1, j + 1, k + 1, w / 2);
    }
}
int main()
{
    int i, j, t, l, r, cnt = 0;
    cin >> n >> t;
    l = 10;
    r = 10;
    for (i = 1; i <= t; i++)
        doit(l, r, 0, 1.0);
    for (i = 0; i < 100; i++)
        for (j = 0; j < 100; j++)
            if (a[i][j] == 1.0)
                cnt++;
    cout << cnt << endl;
    return 0;
}