Recovering highly-complex linear recurrences of integer sequences

We suggest a variant of the Berlekamp-Massey algorithm, originally used for recovering a linear shift register from known output bits, for recovering a linear recurrence satisfied by a sequence of natural numbers from known values of the sequence. We present an application of the algorithm to recovering extremely complex recurrences satisfied by the sequences enumerating polyominoes on twisted cylinders.