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.

A376798 Least number of inequivalent cells in a polycube with n cells.

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 1, 3, 2, 3, 2, 3
Offset: 1

Views

Author

John Mason, Oct 04 2024

Keywords

Comments

a(27) <= 4, a(64) <= 4.

Crossrefs

Formula

a(n) <= A367758(n).
From Pontus von Brömssen, Oct 13 2024: (Start)
n/48 < a(n) <= n/48 + c for some constant c. c = 11 + 19/48 works for n >= 78, but that is not best possible. See link "Inequivalent cells in polycubes".
Conjecture: The sequence (a(n)-n/48) is eventually periodic with period 48.
(End)

A376797 Number of free rooted (or pointed) polycubes with n cells.

Original entry on oeis.org

1, 1, 4, 16, 90, 562, 3960, 29311, 225370, 1766974, 14030739, 112269684, 903020688
Offset: 1

Views

Author

John Mason, Oct 04 2024

Keywords

Examples

			There are 2 polycubes of size 3, each having 2 distinct cells. Therefore a(3)=4.
For further examples, see link.
		

Crossrefs

Showing 1-2 of 2 results.