read `DyckClever.txt`:

with(combinat):

N:=3:

S:=powerset({seq(i,i=1..N)}):

print(` Given sets C and D of positive integers We are interested in counting the number of Dyck paths `):
print(`whose upward runs are never in C and downward runs are never in C`):
print(``):
print(`Below we give the algebraic equation satisfied by the generating function`):
print(`for all sets C and D that are subsets of`):
print(``):
print({seq(i,i=1..N)}):

for C1 in S do
for D1 in S do
print(``):
print(`----------------------------`):
print(``):
 lprint(`(C1,D1)= `, (C1,D1)):
print(``):
lprint(fCD(C1,D1,x,P)=0  ):
print(``):
od:
od:


print(``):
print(`-------------------------`):
print(``):
print(`This took`, time(), `second. `):
print(``):
quit: