These files contain the values of M(216i − 1) and M(216i) for 1 ≤ i ≤ 29, where M(n) is the nth Motzkin number. The reason for storing two consecutive values is of course that the Motzkin recurrence

(n + 4) M(n + 2) − (2 n + 5) M(n + 1) − 3 (n + 1) M(n) = 0

has order 2, so from two consecutive values you can compute subsequent values. Using this precomputed data, any Motzkin number M(n) with 0 ≤ n ≤ 225 can be computed in under ten minutes on a decent machine. The entire data set is approximately 8.4 GB in size.