read `ParkingPollack.txt`: for n from 2 to 6 do print(`The set of parking functions with`, n, `cars is`): print(``): gu:=PF(n): print(PF(n)): print(``): if nops(gu)=(n+1)^(n-1) then print(`Its number of elements is indeed`, (n+1)^(n-1)): else print(`Something went wrong`): fi: od: quit: