Number of inequivalent connected planar figures that can be formed from n 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1, and the adjacency graph of the rectangles is a tree.
A216492
Number of inequivalent connected planar figures that can be formed from n 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1, and the adjacency graph of the rectangles is a tree.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =18a(4) =139a(5) =1286a(6) =12715a(7) =130875a(8) =1378139a(9) =14752392a(10) =159876353a(11) =1749834718a(12) =19307847070
External references
- oeis: A216492