Help:=proc(): print(`fibS(n),fib(n),F(m,n)`):end: fibS:=proc(n) local i,f: f[0]:=0: f[1]:=1: for i from 2 to n do f[i]:=f[i-1]+f[i-2]: od: f[n]: end: fib:=proc(n) local a,b,c,i: a:=0: b:=1: for i from 2 to n do c:=a+b: a:=b: b:=c: od: c: end: #Fstupid(m,n): the number of ways of walking from (0,0) #to (m,n) by a forward-moving Chess King Fstupid:=proc(m,n) local i,j,T: for i from 0 to m do T[i,0]:=1: od: for j from 0 to n do T[0,j]:=1: od: for i from 1 to m do for j from 1 to n do T[i,j]:=T[i-1,j]+T[i,j-1]+T[i-1,j-1]: od: od: T[m,n]: end: F:=proc(m,n) local a,b,i,j: for j from 0 to n do a[j]:=1: od: for i from 1 to m do b[0]:=1: for j from 1 to n do b[j]:=b[j-1]+a[j]+a[j-1]: od: for j from 0 to n do a[j]:=b[j]: od: od: b[n]: end: