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.

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.
		

Crossrefs

Cf. A325300 (number of faces), A325302 (number of vertices).

Formula

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