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.

Showing 1-1 of 1 results.

A367557 The number of fixed kissing polyominoes with n cells.

Original entry on oeis.org

4, 40, 260, 1428, 7184, 34238, 157398, 705518, 3104394, 13469766, 57811669, 245990766
Offset: 7

Views

Author

Johann Peters, Nov 22 2023

Keywords

Comments

Translations are allowed, but not rotations or reflections.
A polyomino is 'kissing' if there exist two cells that touch only at a corner such that no cell exists touching both edgewise simultaneously.
First thirteen terms calculated by filtering the output of Redelmeier's Algorithm.

Examples

			The smallest kissing polyomino has area 7; its four rotations determine the first term in the sequence:
    OOO
    O O
    OO

Links

Crossrefs

Cf. A182644, A376496.

Extensions

a(14)-a(18) from John Mason, Sep 25 2024
Showing 1-1 of 1 results.

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

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