122460716

Appears in sequences

• a(n) is the number of perfect matchings in the circulant graph on 2*n vertices with jumps 1, 2, and 3.at n=20A323709