MathPHP\Sequence\Advanced::triangularNumber PHP Метод

triangularNumber() публичный статический Метод

https://en.wikipedia.org/wiki/Triangular_number n(n + 1) Tn = -------- 2 Example: n = 6 Sequence: 1, 3, 6, 10, 15, 21 Array index: 1, 2, 3, 4, 5, 6
public static triangularNumber ( integer $n ) : array
$n integer How many numbers in the sequence
Результат array Indexed from 1
    public static function triangularNumber(int $n) : array
    {
        $triangular = [];
        // Bad input; return empty list
        if ($n <= 0) {
            return $triangular;
        }
        // Standard case for pn: n(n + 1) / 2
        for ($i = 1; $i <= $n; $i++) {
            $triangular[$i] = $i * ($i + 1) / 2;
        }
        return $triangular;
    }