A367440 - OEIS

A367440

Independence number of the polyomino graph PG(n) defined in A367435.

1, 1, 1, 2, 4, 7, 18, 46

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

OFFSET

1,4

COMMENTS

Maximum size of a set of free polyominoes with n cells such that no polyomino in the set can be obtained from another by moving one of its cells, where the intermediate (the set of cells remaining when the cell to be moved is detached) is required to be a (connected) polyomino.

LINKS

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

Pontus von Brömssen, Maximum independent sets in the polyomino graph for 1 <= n <= 7.

Index entries for sequences related to polyominoes.

FORMULA

a(n) >= A367127(n).

CROSSREFS

Cf. A367127, A367435, A367436.

Sequence in context: A232484 A223013 A276027 * A101569 A225435 A243049

Adjacent sequences: A367437 A367438 A367439 * A367441 A367442 A367443

KEYWORD

nonn,more

AUTHOR

Pontus von Brömssen, Nov 18 2023

STATUS

approved