```python
def No_of_Triangle(N, K):
    """
    Counts the maximum number of equilateral triangles of side K
    that can be formed within a given equilateral triangle of side N.
    """

    def triangular_number(n):
        """
        Calculates the n-th triangular number, T_n = n*(n+1)/2.
        Returns 0 for non-positive n, as no triangles can be formed.
        """
        if n <= 0:
            return 0
        return n * (n + 1) // 2

    # The number of upward-pointing triangles of side K is given by
    # the (N - K + 1)-th triangular number.
    upward_triangles = triangular_number(N - K + 1)

    # The number of downward-pointing triangles of side K is given by
    # the (N - 2*K + 1)-th triangular number.
    downward_triangles = triangular_number(N - 2 * K + 1)

    return upward_triangles + downward_triangles
```