
    Given a delivery fleet's distribution hub as the center point, calculate the total number of possible delivery points that can be serviced within n concentric hexagonal zones, where each zone expands outward in a hexagonal pattern from the central hub. The number of serviceable delivery points follows the centered hexagonal number sequence, which helps optimize route distribution and minimize territory overlap between delivery vehicles.
    

    
def centered_hexagonal_number(n):
    """
    Given a delivery fleet's distribution hub as the center point, calculate the total number of possible delivery points that can be serviced within n concentric hexagonal zones, where each zone expands outward in a hexagonal pattern from the central hub. The number of serviceable delivery points follows the centered hexagonal number sequence, which helps optimize route distribution and minimize territory overlap between delivery vehicles.
    

    """
def centered_hexagonal_number(n):
    """
    Given a delivery fleet's distribution hub as the center point, calculate the total number of possible delivery points that can be serviced within n concentric hexagonal zones, where each zone expands outward in a hexagonal pattern from the central hub. The number of serviceable delivery points follows the centered hexagonal number sequence, which helps optimize route distribution and minimize territory overlap between delivery vehicles.
    

    """
    return 3 * n * (n - 1) + 1