A366768 - OEIS

A366768

Array read by antidiagonals, where each row is the coordination sequence for the underlying graph of the polyominoids occurring in the corresponding row of A366766.

1, 0, 1, 0, 2, 1, 0, 2, 0, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 4, 1, 0, 2, 0, 2, 8, 6, 1, 0, 2, 0, 2, 12, 16, 0, 1, 0, 2, 0, 2, 16, 24, 0, 4, 1, 0, 2, 0, 2, 20, 32, 0, 8, 4, 1, 0, 2, 0, 2, 24, 40, 0, 12, 8, 8, 1, 0, 2, 0, 2, 28, 48, 0, 16, 12, 16, 0, 1

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,5

COMMENTS

The underlying graph of a given type of polyominoids has all possible cells as nodes and edges between cells that are connected (respecting which types of connections are allowed). See A366766 for details on how the allowed connections are specified and on the ordering of the rows.

LINKS

Table of n, a(n) for n=1..78.

Pontus von Brömssen, Python programs that relate row numbers and parameter sets.

Wikipedia, Polyominoid.

Index entries for coordination sequences.

Index entries for sequences related to polyominoes.

EXAMPLE

Array begins:

n\k| 0 1 2 3 4 5 6 7 8 9 10 11

---+----------------------------------------------

1 | 1 0 0 0 0 0 0 0 0 0 0 0

2 | 1 2 2 2 2 2 2 2 2 2 2 2