It’s possible, I suppose.
One of my favorite proofs that the sums of each row are powers of two comes from the fact that the numbers in row n+1 are the coefficients of the powers of (a+b)ⁿ, so setting a=b=1 you get 2ⁿ (most discrete math students seeking to prove this end up reaching for induction which is a heavier proof than this).