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.

A361288 Number of free polyominoes of size 2n for which there exists at least one closed path that passes through each square exactly once.

Table of values

n a(n)
2 1
3 1
4 3
5 6
6 25
7 84
8 397
9 1855
10 9708
11 51684
12 286011
13 1609097
14 9222409
15 53543338
16 314612803

List of values

[1, 1, 3, 6, 25, 84, 397, 1855, 9708, 51684, 286011, 1609097, 9222409, 53543338, 314612803]