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.

A367435 Let PG(n) be the graph with one node for each free n-celled polyomino and edges between nodes corresponding to polyominoes that can be obtained from each other by moving one cell, where the intermediate (the set of cells remaining when the cell to be moved is detached) is required to be a (connected) polyomino. a(n) is the number of edges in PG(n).

Table of values

n a(n)
1 0
2 0
3 1
4 8
5 45
6 254
7 1258
8 6181
9 28062
10 125714
11 550402
12 2394654
13 10326665

List of values

[0, 0, 1, 8, 45, 254, 1258, 6181, 28062, 125714, 550402, 2394654, 10326665]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.