a(n) is the number of perfect matchings of an edge-labeled 2 X n Klein bottle grid graph, or equivalently the number of domino tilings of a 2 X n Klein bottle grid. (The twist is on the length-n side.)

A351635

a(n) is the number of perfect matchings of an edge-labeled 2 X n Klein bottle grid graph, or equivalently the number of domino tilings of a 2 X n Klein bottle grid. (The twist is on the length-n side.)

Terms

    a(0) =2a(1) =6a(2) =10a(3) =16a(4) =38a(5) =54a(6) =142a(7) =196a(8) =530a(9) =726a(10) =1978a(11) =2704a(12) =7382a(13) =10086a(14) =27550a(15) =37636a(16) =102818a(17) =140454a(18) =383722a(19) =524176a(20) =1432070a(21) =1956246a(22) =5344558a(23) =7300804a(24) =19946162a(25) =27246966a(26) =74440090a(27) =101687056a(28) =277814198a(29) =379501254

External references