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.

A345205 Minimum number of unit cubes needed to fully enclose n unit cubes in 3D space.

Original entry on oeis.org

8, 26, 34, 42, 44, 52, 54, 56, 56, 64, 66, 68, 68, 76, 78, 80, 80, 82, 82, 90, 92, 94, 94, 96, 96, 98, 98, 98
Offset: 0

Views

Author

Abraham Maxfield, Jun 10 2021

Keywords

Comments

Cubes are assumed to be aligned in a 3D grid. Cubes with an exposed edge or corner are not considered enclosed.

Examples

			For a(1) the solution is the number of neighbors in Moore's neighborhood in 3 dimensions (3^3-1 = 26).
For a(2) the solution is the neighbors in Moore's neighborhood in 3 dimensions plus the number of neighbors in 2 dimensions (3^2-1 = 8).
		

Crossrefs

Cf. A345206, A235382 (2D equivalent), A007395 (1D equivalent), A024023.
Showing 1-1 of 1 results.