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-2 of 2 results.

A304197 Number of fully-leafed free tree-like 3d-polycubes of size n.

Original entry on oeis.org

1, 1, 2, 2, 2, 1, 1, 4, 100, 42, 16, 3, 1, 31, 1, 989, 164, 17, 2, 384, 10
Offset: 1

Views

Author

Lotfi Bouallagui, May 07 2018

Keywords

Comments

A free tree-like polycube of size n in three dimensions is a face-connected set of n cells in the cubic lattice, up to translation, rotation and reflection, whose dual graph has no cycles. It is said to be fully-leafed when it has the maximal number of leaves over all the same sized free tree-like 3d-polycubes.

Links

  • Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, and Maxime Samson, Fully-leafed tree-like polyominoes and polycubes, In Combinatorial algorithms, volume 10765 of Lecture Notes of Computer Science, 28th International workshop, IWOCA 2017, Newcastle, NSW, Australia, Springer, 2018.

Crossrefs

Cf. A304196 (free tree-like 3d-polycubes), A304195, A304199 (fully-leafed free tree-like polyominoes and 4d-polycubes resp.).

A304199 Number of fully-leafed free tree-like 4d-polycubes of size n.

Original entry on oeis.org

1, 1, 2, 2, 3, 2, 2, 1, 1, 6, 602, 324, 148, 48, 16, 3, 1, 186, 30, 6, 1
Offset: 1

Views

Author

Lotfi Bouallagui, May 07 2018

Keywords

Comments

A free tree-like polycube of size n in four dimensions is a hyperface-connected set of n cells in the 4d-hypercubic lattice, up to translation, rotation and reflection, whose dual graph has no cycles. It is said to be fully-leafed when it has the maximal number of leaves over all the same sized free tree-like 4d-polycubes.

Links

  • Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, and Maxime Samson, Fully-leafed tree-like polyominoes and polycubes, In Combinatorial algorithms, volume 10765 of Lecture Notes of Computer Science, 28th International workshop, IWOCA 2017, Newcastle, NSW, Australia, Springer, 2018.

Crossrefs

Cf. A304198 (free tree-like 4d-polycubes), A304195, A304197 (fully-leafed free tree-like polyominoes and 3d-polycubes resp.).
Showing 1-2 of 2 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.