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

A325300 a(n) is the number of faces of the stepped pyramid with n levels described in A245092.

Original entry on oeis.org

6, 9, 15, 20, 24, 31, 35, 42, 49, 59, 63, 72, 76, 84, 95, 106, 110, 121, 125
Offset: 1

Views

Author

Omar E. Pol, Apr 16 2019

Keywords

Comments

To calculate a(n) consider that levels greater than n do not exist.
The shape of the n-th level of the pyramid allows us to know if n is prime (see the Formula section).
For more information about the sequences that we can see in the pyramid see A262626.

Examples

			For n = 1 the first level of the stepped pyramid (starting from the top) is a cube, and a cube has six faces, so a(1) = 6.

Links

Crossrefs

Cf. A325301 (number of edges), A325302 (number of vertices).
Cf. A196020, A215848, A235791, A236104, A237270, A237271, A237591, A237593, A245092, A262626, A299692, A323645, A323648.

Formula

a(n) = A325301(n) - A325302(n) + 2 (Euler's formula).
a(n) = A323645(n) + 3.
a(n) = a(n-1) + 4 iff n is a prime > 3 (A215848).

A325301 a(n) is the number of edges of the stepped pyramid with n levels described in A245092.

Original entry on oeis.org

12, 21, 36, 51, 63, 84, 96, 117, 138, 165, 177, 204, 216, 240, 273, 306, 318, 351, 363
Offset: 1

Views

Author

Omar E. Pol, Apr 16 2019

Keywords

Comments

To calculate a(n) consider that levels greater than n do not exist.

Examples

			For n = 1 the first level of the stepped pyramid (starting from the top) is a cube, and a cube has 12 edges, so a(1) = 12.

Links

Crossrefs

Cf. A325300 (number of faces), A325302 (number of vertices).
Cf. A196020, A235791, A236104, A237270, A237271, A237591, A237593, A245092, A262626, A294848, A294849, A317109, A323648.

Formula

a(n) = A325300(n) + A325302(n) - 2 (Euler's formula).

A346532 a(n) is the number of vertices of the polycube called "tower" described in A221529 where n is the longest side of its base.

Original entry on oeis.org

8, 8, 18, 24, 33, 47, 55, 69, 77, 95, 108
Offset: 1

Views

Author

Omar E. Pol, Jul 22 2021

Keywords

Comments

The height of the tower equals A000041(n-1).

Examples

			For n = 1 the tower is a cube, and a cube has 8 vertices, so a(1) = 8.

Crossrefs

Cf. A000203 (area of the terraces), A000041 (height of the terraces), A066186 (volume), A345023 (surface area), A346530 (number of faces), A346531 (number of edges).
Cf. A325302 (analog for the pyramid described in A245092).
Cf. A221529, A236104, A237270, A237271, A237593, A336811, A338156, A340035, A340584.

Formula

a(n) = A346531(n) - A346530(n) + 2 (Euler's formula).
Showing 1-3 of 3 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.