Pascal Triangle recursive

PascalTriangleRecursive.scala

def PascalTriangleRecursive(row: Int, triangle: List[List[Int]], rows: Int): List[List[Int]] = {
    val newRow =
        if(row == 0)
            List(1)
        else {
            val lastRow = 0 +: (triangle.last :+ 0)
            for((i, j) <- lastRow.init zip lastRow.tail)
                yield i + j
        }
    val newTriangle = triangle :+ newRow
    if(row >= rows - 1)
        newTriangle
    else
        loop(row + 1, newTriangle, rows)
}