Get binomial coefficients of Pascal's triangle.

pascal.js

function pascal(n) {
  if (n === 0)
    return [1];
  let prev = n - 1;
  let times = prev;
  let leftLength = Math.floor(n / 2) + 1;
  let lead = Array(prev).fill(1);
  let temp = [1];
  let result_l = [1];
  let result_r = [1];
  for (let t = leftLength; t > 1; t--) {
    times--;
    for (let i = 0; i <= times; i++) {
      temp.push(temp[i] + lead[i]);
    }

    lead = temp.slice(1, t + 3);
    result_l.push(lead[lead.length - 1]);
    if (result_r.length < leftLength - (prev) % 2)
      result_r.unshift(lead[lead.length - 1]);
    temp = [1];
  }
  return result_l.concat(result_r);
}

for (let i = 0; i <= 8; i++)
  console.log(pascal(i));

pascal.py

def pascal(n) :
    if n == 0 :
        return [1]
    prev = n - 1
    times = prev
    leftLength = int( n / 2 ) + 1 # Math.foor
    lead = [1] * prev # Array(prev).fill(1)
    temp = [1]
    result_l = [1]
    result_r = [1]
    for t in range(leftLength, 1, -1) : # 1 < t <= leftLength
        times = times - 1
        for i in range(0, times + 1) : # 0 <= i < times + 1
            temp.append(temp[i] + lead[i]) # Array.push
        lead = temp[1:t+3] # Array.slice
        result_l.append(lead[len(lead)-1]) # Arrray.push
        if len(result_r) < (leftLength - prev % 2) :
            result_r = [ lead[len(lead)-1] ] + result_r # Array.unshift
        temp = [1]
    return result_l + result_r # Array.cocat

for i in range(8) :
    print(pascal(i))