Розв’язок задачі з Абрамова №345

program Pr3845;
const
  cSeqMax = 10;
type
  TSeq = array [0..cSeqMax] of LongInt;
var
  t : TSeq;
  k : Byte;
  i : Byte;
begin
  t [0] := 1;
  for k := 1 to cSeqMax do
  begin
    t [k] := 0;
    for i := 0 to k - 1 do
      t [k] := t [k] + t [i] * t [k - i - 1];
  end;
  writeln ('t (10) = ', t [10]);
end.