cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.)

Table of values

n a(n)
1 2
2 6
3 10
4 16
5 38
6 54
7 142
8 196
9 530
10 726
11 1978
12 2704
13 7382
14 10086
15 27550
16 37636
17 102818
18 140454
19 383722
20 524176
21 1432070
22 1956246
23 5344558
24 7300804
25 19946162
26 27246966
27 74440090
28 101687056
29 277814198
30 379501254
31 1036816702
32 1416317956
33 3869452610
34 5285770566
35 14440993738
36 19726764304
37 53894522342
38 73621286646

List of values

[2, 6, 10, 16, 38, 54, 142, 196, 530, 726, 1978, 2704, 7382, 10086, 27550, 37636, 102818, 140454, 383722, 524176, 1432070, 1956246, 5344558, 7300804, 19946162, 27246966, 74440090, 101687056, 277814198, 379501254, 1036816702, 1416317956, 3869452610, 5285770566, 14440993738, 19726764304, 53894522342, 73621286646]