--Copyright The Numerical Algorithms Group Limited 1991.

)clear all
-- this file shows some computations involving Pascal's triangle
)set fun cache all
p(m,n | m = 1) == 1
p(m,n | m = n) == 1
p(i,n | 1 < i and i < n) == p(i-1,n-1)+p(i,n-1)
p(2,3)
pr(n) == [p(i,n) for i in 1..n]
l := [center blankSeparate [p(i,n)::OUTFORM for i in 1..n] for n in 1..10] ;
