def zigzag(n, k):
    if n == 0 and k == 0:
        return 1
    if k == 0:
        return 0
    
    # Build the Entringer number table using the recurrence:
    # E(n, 0) = 0 for n >= 1
    # E(0, 0) = 1
    # E(n, k) = E(n, k-1) + E(n-1, n-k)
    
    E = [[0] * (n + 1) for _ in range(n + 1)]
    E[0][0] = 1
    
    for i in range(1, n + 1):
        E[i][0] = 0
        for j in range(1, i + 1):
            E[i][j] = E[i][j-1] + E[i-1][i-j]
    
    return E[n][k]