```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.
    
    The formula is derived by counting triangles in two orientations:
    1. Pointing up: The number of such triangles is T(N - K + 1).
    2. Pointing down: The number of such triangles is T(N - 2*K + 1).
    
    T(n) is the n-th triangular number, defined as n*(n+1)/2 for n > 0, and 0 otherwise.
    """
    
    # Helper function for triangular numbers
    T = lambda n: n * (n + 1) // 2 if n > 0 else 0
    
    # Number of triangles pointing up
    up_triangles = T(N - K + 1)
    
    # Number of triangles pointing down
    down_triangles = T(N - 2 * K + 1)
    
    return up_triangles + down_triangles
```